On rational graphs

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

Volumn 1784 LNCS, Issue , 2000, Pages 252-266

  Morvan, Christophe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPHIC METHODS; COMPUTATIONAL LINGUISTICS;

CONTEXT-FREE; EQUATIONAL GRAPHS; INFINITE GRAPH; LANGUAGE THEORY; PREFIX-RECOGNIZABLE GRAPHS; RATIONAL GRAPHS; RECURSIVE LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 84878648266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_17     Document Type: Conference Paper

References (12)

1. A. Arnold and M. Nivat, Comportements de processus, Colloque AFCET "les mathématiques de l'informatique", pp. 35-68, 1982.
2. J.-M. Autebert and L. Boasson, Transductions rationelles, Ed. Masson, pp. 1-133, 1988.
3. J. Berstel Transductions and context-free languages, Ed. Teubner, pp. 1-278, 1979.
4. D. Caucal On transition graphs having a decidable monadic theory, LNCS 1099, pp. 194-205, 1996, (Pubitemid 126097567)
5. B. Courcelle Graph rewriting: an algebraic and logic approach, Handbook of TCS, Vol. B, Elsevier, pp. 193-242, 1990.
6. S. Ginsburg and S. A. Greibach Mappings which preserve context sensitive languages, Information and Control 9, pp. 563-582, 1966.
7. J. E. Hopcroft and J. D. Ullman Introduction to automata theory, langages and computation, Ed. Addison-Wesley pp. 1-284, 1979.
8. T. Knapik and E. Payet Synchronization product of Linear Bounded Machines, LNCS 1684, pp. 362-373, 1999.
9. D. Muller and P. Schupp The theory of ends, pushdown automata, and second-order logic, TCS 37, pp. 51-75, 1985. (Pubitemid 15546080)
10. M. Nivat Transduction des langages de Chomsky, Ann. de l'Inst. Fourier 18, pp. 339-456, 1968.
11. W. Reisig Petri nets. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag, 1985.
12. M.P. Schützenberger Sur les relations rationnelles entre monoïdes libres, TCS 3, pp. 243-259, 1976.