On Word Rewriting Systems Having a Rational Derivation

  • Didier Caucal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1784)

Abstract

We define four families of word-rewriting systems: the prefix/suffix systems and the left/right systems. The rewriting of prefix systems generalizes the prefix rewriting of systems: a system is prefix (suffix) if a left hand side and a right hand side are overlapping only by prefix (suffix). The rewriting of right systems generalizes the mechanism of transducers: a system is right (left) if a left hand side overlaps a right hand side only on the right (left).

We show that these systems have a rational derivation even if they are not only finite but recognizable. Besides these four families, we give simple systems having a non rational derivation.

References

  1. [AB 88]
    J.-M. Autebert and L. Boasson Transductions rationnelles, Ed. Masson, pp 1–133, 1988.Google Scholar
  2. [Be 79]
    J. Berstel Transductions and context-free languages, Ed. Teubner, pp. 1–278, 1979.Google Scholar
  3. [BN 84]
    L. Boasson and M. Nivat Centers of context-free languages, LITP report 84-44, 1984.Google Scholar
  4. [BO 93]
    R. Book and F. Otto String-rewriting systems, Text and monographs in computer science, Springer Verlag, 189 pages, 1993.Google Scholar
  5. [Bü 64]
    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.MATHGoogle Scholar
  6. [CK 98]
    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.Google Scholar
  7. [Ca 90]
    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.Google Scholar
  8. [Ca 96]
    D. Caucal On infinite transition graphs having a decidable monadic theory, ICALP 96, LNCS 1099, pp. 194–205, 1996.Google Scholar
  9. [Co 90]
    B. Courcelle Graph rewriting: an algebraic and logic approach, Handbook of TCS, Vol. B, Elsevier, pp. 193–242, 1990.Google Scholar
  10. [DJ 90]
    N. Dershowitz and J.-P. Jouannaud Rewrite systems, Handbook of TCS, Vol. B, Elsevier, pp. 243–320, 1990.MathSciNetGoogle Scholar
  11. [Mo 00]
    C. Morvan On rational graphs, FOSSACS 2000, in this volume.Google Scholar
  12. [MS 85]
    D. Muller and P. Schupp The theory of ends, pushdown automata, and second-order logic, TCS 37, pp. 51–75, 1985.MATHCrossRefMathSciNetGoogle Scholar
  13. [Sé 93]
    G. Sénizergues Formal languages and word-rewriting, LNCS 909, pp. 75–94, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Didier Caucal
    • 1
  1. 1.IRISA-CNRSRennesFrance

Personalised recommendations