29 search results - page 4 / 6 » On Reversible Automata |
118
click to vote
MCU
1998
15 years 2 months ago
1998
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
TCS
2008
15 years 16 days ago
2008
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
135
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
104
Voted
ATVA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
114
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward t...