512 search results - page 35 / 103 » Automata as Abstractions |
101
click to vote
AE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We aim to construct an automatic system for the discovery of collision-based universal cellular automata that simulate Turing machines in their space-time dynamics using ...
119
click to vote
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
DLT
2008
15 years 1 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
FMSB
2008
15 years 1 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
LATA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...