512 search results - page 48 / 103 » Automata as Abstractions |
153
click to vote
LATA
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
101
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
104
click to vote
CSL
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CADE
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...