Local Languages and the Berry-Sethi Algorithm

[1]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[2]  V. Glushkov.  THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[3]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[4]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5]  Gérard Berry,et al.  From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..

[6]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[7]  Jean Berstel,et al.  Finite automata and rational languages. An introduction , 1987, Formal Properties of Finite Automata and Applications.

[8]  Derick Wood,et al.  Deterministic Regular Languages , 1991, STACS.

[9]  Anne Brüggemann-Klein,et al.  Regular Expressions into Finite Automata , 1992, Theor. Comput. Sci..

[10]  B. Watson.  A taxonomy of finite automata minimization algorithms , 1993 .

[11]  B. Watson.  A taxonomy of finite automata construction algorithms , 1993 .

[12]  Djelloul Ziadi,et al.  Passage d'une expression rationnelle à un automate fini non-déterministe , 1997 .