Local languages and the Berry-Sethi algorithm

Theoretical Computer Science

Volumn 155, Issue 2, 1996, Pages 439-446

  Berstel, Jean ^a   Pin, Jean Eric ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; FORMAL LANGUAGES; PROGRAM COMPILERS; PROGRAM DOCUMENTATION;

BERRY-SETHI ALGORITHM; LOCAL LANGUAGES;

FINITE AUTOMATA;

EID: 0030108489     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00104-2     Document Type: Article

References (13)

1. A.V. Aho, R. Sethi and J. Ullman, Compilers: Principles, Techniques and Tools. Addison-Wesley Series in Computer Science (Addison-Wesley, Reading, Mass., 1986).
2. G. Berry and R. Sethi, From regular expressions to deterministic automata, Theoret. Comput. Sci. 48 (1986) 117-126.
3. J. Berstel, Finite automata and rational languages, an introduction, in: J.E. Pin, ed., Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, Vol. 386 (1987) 2-14.
4. A. Brüggemann-Klein, Regular expressions into finite automata, in: LATIN'92, Lecture Notes in Computer Science, Vol. 583 (1992) 87-98.
5. A. Brüggemam-Klein and D. Wood, Deterministic regular languages, in: STACS 92, Lecture Notes in Computer Science, Vol. 577 (1992) 173-184.
6. J.M. Champarnaud, From a regular expression to an automaton, Inform. Process. Lett., to appear.
7. S. Eilenberg, Automata, Languages and Machines, Vol A (Academic Press, New York, 1974).
8. V.M. Glushkov, The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
9. R. McNaughton and H. Yamada, Regular expressions and state graphs for automata, IEEE Trans, Electronic Comput. 9 (1960) 39-47.
10. M. Nivat, Transductions des langages de Chomsky, Ann. Fourier 18 (1968) 339-455.
11. B.W. Watson, A taxonomy of finite automata construction algorithms, Computing Science Note 93-43, Eindhoven University of Technology. The Netherlands, 1993.
12. B.W. Watson, A taxonomy of finite automata minimization algorithms, Computing Science Note 93-44, Eindhoven University of Technology, The Netherlands, 1993.
13. D. Ziadi, J.L. Ponty and J.-M. Champarnaud, Passage d'une expression rationnelle à un automate fini non-déterministe, Bull. Belgian Math. Soc. Simon Stevin, to appear.