- Full text PDF available (2)
- This year (0)
- Last 5 years (2)
- Last 10 years (2)
Journals and Conferences
With every rational language we associate a canonical non-determinis-tic automaton, that subsumes all possible \minimal" automata recognizing this language.
I. Castellani (1987, J. Comput. System Sri. 34, 210-235) has shown that observation equivalence of transition systems could be characterized by particular reductions: systems are equivalent if, and… (More)
In this paper, we show how the study of two-way automata on words may relevantly be extended to the study of two-way automata on one-dimensional overlapping tiles that generalize finite words.… (More)