Deleting String Rewriting Systems Preserve Regularity

  • Dieter Hofbauer
  • Johannes Waldmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2710)


A string rewriting system R is called deleting if there exists a partial ordering on its alphabet such that each letter in the right hand side of a rule is less than some letter in the corresponding left hand side. We show that the rewrite relation R* induced by R can be represented as the composition of a finite substitution (into an extended alphabet), a rewrite relation of an inverse context-free system (over the extended alphabet), and a restriction (to the original alphabet). Here, a system is called inverse context-free if |r| ≤ 1 for each rule r. The decomposition result directly implies that deleting systems preserve regularity, and that inverse deleting systems preserve context-freeness. The latter result was already obtained by Hibbard [Hib74].


Regular Language Canonical System Tree Automaton Pivot Rule Bubble Sort 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ber79]
    Jean Berstel. Transductions and Context-Free Languages. Teubner, Stuttgart, 1979.zbMATHGoogle Scholar
  2. [BH70]
    J. Richard Büchi and William H. Hosken. Canonical systems which produce periodic sets. Math. Syst. Theory, 4:81–90, 1970.CrossRefGoogle Scholar
  3. [BJW82]
    Ronald V. Book, Matthias Jantzen, and Celia Wrathall. Monadic Thue systems. Theoret. Comput. Sci., 19:231–251, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [BO93]
    Ronald V. Book and Friedrich Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1993.zbMATHGoogle Scholar
  5. [Büc64]
    J. Richard Büchi. Regular canonical systems. Arch. Math. Logik und Grundlagenforschung, 6:91–111, 1964.CrossRefGoogle Scholar
  6. [Büc89]
    J. Richard Büchi. Finite Automata, Their Algebras and Grammars — Towards a Theory of Formal Expressions. D. Siefkes (Ed.). Springer-Verlag, New York, 1989.Google Scholar
  7. [DM79]
    Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Commun. ACM, 22(8):465–476, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [Fra86]
    Roland Fraïssé. Theory of Relations, volume 118 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1986.zbMATHGoogle Scholar
  9. [GG66]
    Seymour Ginsburg and Sheila A. Greibach. Mappings which preserve context sensitive languages. Inform. and Control, 9(6):563–582, 1966.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [Hib74]
    Thomas N. Hibbard. Context-limited grammars. J. ACM, 21(3):446–453, 1974.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [HW03]
    Dieter Hofbauer and Johannes Waldmann. Deleting string rewriting systems preserve regularity. Mathem. Schriften 07/03, Univ. Kassel, Germany, 2003.Google Scholar
  12. [Kra65]
    M. I. Kratko. A class of Post calculi. Soviet Math. Doklady, 6(6):1544–1545, 1965.zbMATHGoogle Scholar
  13. [Ott98]
    Friedrich Otto. Some undecidability results concerning the property of preserving regularity. Theoret. Comput. Sci., 207:43–72, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [Pos43]
    Emil L. Post. Formal reductions of the general combinatorial decision problem. Amer. J. Math., 65:197–215, 1943.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [Tis00]
    Sophie Tison. Tree automata and term rewrite systems. In Leo Bachmair (Ed.), Proc. 11th Int. Conf. Rewriting Techniques and Applications RTA-00, Lect. Notes Comp. Sci. Vol. 1833, pp. 27–30. Springer-Verlag, 2000.Google Scholar
  16. [Yu98]
    Sheng Yu. Regular languages. In G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, pp. 41–110. Springer-Verlag, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dieter Hofbauer
    • 1
  • Johannes Waldmann
    • 2
  1. 1.Fachbereich Mathematik/InformatikUniversität KasselKasselGermany
  2. 2.Fakultät für Mathematik und InformatikUniversität LeipzigLeipzigGermany

Personalised recommendations