On the construction of reversible automata for reversible languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 170-182

  Lombardy, Sylvain ^a  

^a INSTITUT TELECOM   (France)

Author keywords

Finite automata; Reversible automata; Reversible languages; Universal automata

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; FINITE AUTOMATA;

DIFFERENT DOMAINS; MINIMAL AUTOMATON; REVERSIBLE AUTOMATA; UNIVERSAL AUTOMATA;

ARTIFICIAL INTELLIGENCE;

EID: 84869185698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_16     Document Type: Conference Paper

References (13)

1. A. Arnold, A. Dicky, and M. Nivat, A note about minimal non-deterministic automata. Bull. of E.A.T.C.S. 47 (1992), 166-169.
2. C. J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. (Series A) 43 (1987), 81-90.
3. R. S. Cohen and J. A. Brzozowski, General properties of star height of regular events, J. Computer System Sci. 4 (1970), 260-280.
4. J. H. Conway, Regular algebra and finite machines, Chapman and Hall, 1971.
5. P.-C. Héam, A lower bound for reversible automata, Theoret. Informatics Appl. 34 (2000), 331-341.
6. P.-C. Héam, Some topological properties of rational sets, J. of Automata, Lang. and Comb. 6 (2001), 275-290.
7. S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata, Proc. 5th Latin Conf., (S. Rajsbaum, Ed.), Lecture Notes in Comput. Sci. 2286 (2002).
8. O. Matz and A. Potthoff, Computing small nondeterministic finite automata. Proc. TACAS'95, BRICS Notes Series (1995), 74-88.
9. C. Nicaud, Étude du comportement en moyenne des automates finis et des langages rationnels, Thèse de doctorat, Université Paris 7, 2000.
10. J.-E. Pin, On reversible automata, Proc. 1st LATIN Conf., (I. Simon, Ed.), Lecture Notes in Comput. Sci. 583 (1992), 401-416.
11. J.-E. Pin, A variety theorem without complementation, Russian mathematics 39 (1995), 80-90.
12. J. Sakarovitch, Éléments de théorie des automates, Vuibert, to appear.
13. P.V. Silva, On free inverse monoid languages, Theoret. Informatics and Appl. 30 (1996), 349-378.