A characterization of Thompson digraphs

Discrete Applied Mathematics

Volumn 134, Issue 1-3, 2004, Pages 317-337

  Giammarresi, Dora ^a   Ponty, Jean Luc ^b   Wood, Derick ^c   Ziadi, Djelloul ^d  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b Hong Kong Univ of Sci/Technology ^*  (France)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d UNIVERSITÉ DE ROUEN   (France)

Author keywords

Dyck strings; Regular expressions; Thompson digraphs and machines

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; GRAPH THEORY;

REGULAR EXPRESSIONS;

FINITE AUTOMATA;

EID: 0242366696     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00299-3     Document Type: Article

References (10)

1. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA, 1986.
2. Aho A.V., Ullman J.D. The Theory of Parsing. Translation, and Compiling. Vol. I: Parsing:1972;Prentice-Hall, Englewood Cliffs, NJ.
3. Brüggemann-Klein A., Wood D. The validation of SGML content models. Math. Comput. Modelling. 25:1997;73-84.
4. Caron P., Ziadi D. Characterization of Glushkov automata. Theoret. Comput. Sci. 233:2000;75-90.
5. D. Giammarresi, J.-L. Ponty, D. Wood, The Glushkov and Thompson constructions: a synthesis, unpublished manuscript, July 1998, URL: http://www.cs.ust.hk/tcsc/RR/1998-11.ps.gz.
6. Hopcroft J.E., Ullman J.D. Formal Languages and Their Relationship to Automata. 1969;Addison-Wesley, Reading, MA.
7. Kleene S.C. Representation of events in nerve nets and finite automata. Shannon C.E., McCarthy J. Automata Studies. 1956;3-42 Princeton University Press, Princeton, NJ.
8. Mirkin B.G. An algorithm for constructing a base in a language of regular expressions. Eng. Cybernet. 5:1966;110-116.
9. S. Sippu, E. Soisalon-Soininen, Parsing theory: I languages and parsing, EATCS Monographs on Theoretical Computer Science, Vol. 15, Springer, New York, NY, 1988.
10. Thompson K. Regular expression search algorithm. Commun. ACM. 11:1968;419-422.