On word rewriting systems having a rational derivation

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

Volumn 1784 LNCS, Issue , 2000, Pages 48-62

  Caucal, Didier ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

REWRITING SYSTEMS; RIGHT-HAND SIDES; SIMPLE SYSTEM;

COMPUTATION THEORY;

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

References (13)

1. J.-M. Autebert and L. Boasson Transductions rationnelles, Ed. Masson, pp 1-133, 1988.
2. J. Berstel Transductions and context-free languages, Ed. Teubner, pp. 1-278, 1979.
3. L. Boasson and M. Nivat Centers of context-free languages, LITP report 84-44, 1984.
4. R. Book and F. Otto String-rewriting systems, Text and monographs in computer science, Springer Verlag, 189 pages, 1993.
5. R. Büchi Regular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung 6, pp. 91-111, 1964 or in The collected works of J. Richard Büchi, edited by S. Mac Lane and D. Siefkes, Springer-Verlag, New York, pp. 317-337, 1990.
6. H. Calbrix and T. Knapik A string-rewriting characterization of Muller and Schupp's context-free graphs, FSTTCS 98, LNCS 1530, pp. 331-342, 1998.
7. D. Caucal On the regular structure of prefix rewriting, CAAP 90, LNCS 431, pp. 87-102, 1990, selected in TCS 106, pp. 61-86, 1992.
8. D. Caucal On infinite transition graphs having a decidable monadic theory, ICALP 96, LNCS 1099, pp. 194-205, 1996. (Pubitemid 126097567)
9. B. Courcelle Graph rewriting: an algebraic and logic approach, Handbook of TCS, Vol. B, Elsevier, pp. 193-242, 1990.
10. N. Dershowitz and J.-P. Jouannaud Rewrite systems, Handbook of TCS, Vol. B, Elsevier, pp. 243-320, 1990.
11. C. Morvan On rational graphs, FOSSACS 2000, in this volume.
12. D. Muller and P. Schupp The theory of ends, pushdown automata, and second-order logic, TCS 37, pp. 51-75, 1985. (Pubitemid 15546080)
13. G. Sénizergues Formal languages and word-rewriting, LNCS 909, pp. 75-94, 1993.