Canonical derivatives, partial derivatives and finite automaton constructions

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 137-163

  Champarnaud, J M ^a   Ziadi, D ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Derivatives; Finite automata; Regular expressions

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FINITE AUTOMATA; MATHEMATICAL TECHNIQUES;

REGULAR EXPRESSIONS;

COMPUTER SCIENCE;

EID: 0037163975     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00267-5     Document Type: Article

References (15)

1. Aho A.V., Hopcroft J.E., Ullman J.D. Data Structures and Algorithms. 1983; Addison-Wesley, Reading, MA.
2. Antimirov V. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155: 1996; 291-319.
3. Beauquier D., Berstel J., Chrétienne P. Éléments d'Algorithmique. 1992; Masson, Paris.
4. Berry G., Sethi R. From regular expressions to deterministic automata. Theoret. Comput. Sci. 48(1): 1986; 117-126.
5. Brzozowski J.A. Derivatives of regular expressions. J. Assoc. Comput. Mach. 11(4): 1964; 481-494.
6. J.-M. Champarnaud, D. Ziadi, From C-continuations to new quadratic algorithms for automaton synthesis, Internat. J. Algebra Comput. 11 (6) (2001) 707-735.
7. J.-M. Champarnaud, D. Ziadi, From Mirkin's prebases to Antimirov's word partial derivatives, Fund. Inform. 45(3) (2001) 195-205.
8. Glushkov V.M. The abstract theory of automata. Russian Math. Surveys. 16: 1961; 1-53.
9. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages and Computation. 1979; Addison-Wesley, Reading, MA.
10. S. Kleene, Representation of events in nerve nets and finite automata, Automata Studies Annals of Mathematics Studies vol. 34, 1956, Princeton University Press, Princeton NJ, pp. 3-41.
11. McNaughton R.F., Yamada H. Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 9: 1960; 39-57.
12. Mirkin B.G. An algorithm for constructing a base in a language of regular expressions. Eng. Cybernet. 5: 1966; 110-116.
13. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM J. Comput. 16(6): 1987; 973-989.
14. S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. I, Words, Languages, Grammars, Springer, Berlin, 1997, pp. 41-110.
15. Ziadi D., Ponty J.-L., Champarnaud J.-M. Passage d'une expression rationnelle à un automate fini non-déterministe. Bull. Belg. Math. Soc. 4: 1997; 177-203.