How expressions can code for automata

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

Volumn 2976, Issue , 2004, Pages 242-251

  Lombardy, Sylvain ^a   Sakarovitch, Jacques ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MOORE ALGORITHM; NONDETERMINISTIC AUTOMATA; RATIONAL EXPRESSIONS;

AUTOMATA THEORY;

EID: 21144434329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_28     Document Type: Article

References (18)

1. V. ANTIMIROV, Partial derivatives of regular expressions and finite automaton constructions, Theoret. Computer Sci. 155 (1996), 291-319.
2. A. ARNOLD, Systèmes de transitions finis et sémantique des processus communiquants, Masson, 1992.
3. English translation: Finite transitions systems, Prentice-Hall, 1994.
4. G. BERRY AND R. SETHI, From regular expressions to deterministic automata, Theoret. Computer Sci. 48 (1986), 117-126.
5. J. BERSTEL AND J.-E. PIN, Local languages and the Berry-Sethi algorithm, Theoret. Computer Sci. 155 (1996), 439-446.
6. J. A. BRZOZOWSKI, Derivatives of regular expressions. J. Assoc. Comput. Mach. 11 (1964), 481-494.
7. P. CARON AND D. ZIADI, Characterization of Glushkov automata, Theoret. Computer Sci. 233 (2000), 75-90.
8. J.-M. CHAMPARNAUD AND D. ZIADI, New finite automaton constructions based on canonical derivatives, Pre-Proceedings of CIAA'00, M. Daley, M. Eramian and S. Yu, eds, Univ. of Western Ontario, (2000), 36-43.
9. J.-M. CHAMPARNAUD AND D. ZIADI, Canonical derivatives, partial derivatives and finite automaton constructions, Theoret. Computer Sci. 289 (2002), 137-163.
10. J. H. CONWAY, Regular algebra and finite machines, Chapman and Hall, 1971.
11. V. GLUSHKOV, The abstract theory of automata, Russian Mathematical Surveys 16 (1961), 1-53.
12. S. LOMBARDY AND J. SAKAROVITCH, Derivatives of rational expressions with multiplicity, in MFCS 02, LNCS 2420 (2002), 471-482.
13. S. LOMBARDY AND J. SAKAROVITCH, How expressions code for automata, TIARAIRO, to appear.
14. R. MCNAUGHTON AND H. YAMADA, Regular expressions and state graphs for automata. IRE Trans. on Electronic Computers 9 (1960), 39-47.
15. J. SAKAROVITCH, A construction on automata that has remained hidden, Theoret. Computer Sci. 204 (1998), 205-231.
16. K. THOMPSON, Regular expression search algorithm, Comm. Assoc. Comput. Mach. 11 (1968), 419-422.
17. D. WOOD, Theory of Computation, Wiley, 1987.
18. S. Yu, Regular languages, in Handbook of Formal Languages, G. Rozenberg and A. Salomaa (esd.), vol. 1, pp. 41-111, Elsevier, 1997.