The language, the expression, and the (small) automaton

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

Volumn 3845 LNCS, Issue , 2006, Pages 15-30

  Sakarovitch, Jacques ^a  

^a INSTITUT TELECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE;

AUTOMATON;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745174811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_2     Document Type: Conference Paper

References (30)

1. Eilenberg, S.: Automata, Languages, and Machines. Vol. A. Academic Press (1974)
2. Berstel, J.: Transductions and Context-free Languages. B. G. Teubner (1979)
3. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electronic Computers 9 (1960) 39-47
4. Wood, D.: Theory of Computation. John Wiley (1987)
5. Yu, S.: Regular languages. In Rozenberg, G., Salomaa, A., eds.: Handbook of Formal Languages. Volume 1., Elsevier (1997) 41-111
6. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971)
7. Krob, D.: Complete systems of B-rational identities. Theoret. Computer Sci. 89 (1991) 207-343
8. Sakarovitch, J.: Eléments de théorie des automates. Vuibert (2003)
9. English translation: Elements of Automata Theory, Cambridge University Press, to appear.
10. Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Electronic Computers 12 (1963) 67-76
11. Lombardy, S., Régis-Gianas, Y., Sakarovitch, J.: Introducing Vaucanson. Theoret. Computer Sci. 328 (2004) 67-76
12. Journal version of Proc. of CIAA 2003, Lect. Notes in Comp. Sc. 2759, (2003), 96-107 (with R. Poss).
13. Delgado, Morais: Approximation to the smallest regular expression for a given regular language. In Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S., eds.: Proc. of CIAA 04, Lecture Notes in Computer Science 3317, Springer (2004) 312-314
14. Claveirole, T., Lombardy, S., O'Connor, S., Pouchet, L.N., Sakarovitch, J.: Inside Vaucanson. In Farré, J., Litovsky, I., eds.: Proc. of CIAA 05, Springer (2005) this volume.
15. Glushkov, V.M.: The abstract theory of automata. Russian Math. Surveys 16 (1961) 1-53
16. Caron, P., Flouret, M.: Glushkov construction for multiplicities. In Daley, M., Eramian, M., Yu, S., eds.: Pre-Proceedings of CIAA'00. (2000) 52-61
17. Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332 (2005) 141-177
18. Thompson, K.: Regular expression search algorithm. Comm. Assoc. Comput. Mach. 11 (1968) 419-422
19. Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11 (1964) 481-494
20. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155 (1996) 291-319
21. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48 (1986) 117-126
22. Berstel, J., Pin, J.E.: Local languages and the Berry-Sethi algorithm. Theor. Comput. Sci. 155 (1996) 439-446
23. Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289 (2002) 137-163
24. Brügemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120 (1993) 197-213
25. 2(n)) time. Theoret. Inform. Appl. 34 (2000) 257-277
26. Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. System Sci. 62 (2001) 565-588
27. Hie, L., Yu, S.: Constructing NFAs by optimal use of positions in regular expressions. In Apolostolico, A., Takeda, M., eds.: Proc. of CPM'02, Lecture Notes in Computer Science 2373, Springer (2002) 279-288
28. Champarnaud, J.M., Nicart, F., Ziadi, D.: Computing the follow automaton of an expression. In Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S., eds.: Proc. of CIAA 04, Lecture Notes in Computer Science 3317, Springer (2004) 90-101
29. Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theor. Comput. Sci. 233 (2000) 75-90
30. Lombardy, S., Sakarovitch, J.: How expressions can code for automata. Theoret. Inform. App. 39 (2005) 217-237