2467 search results - page 130 / 494 » Finite State Machines |
164
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
164
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
154
click to vote
DLT
2006
15 years 8 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
155
click to vote
IPL
2006
15 years 6 months ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...