Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1999: Rewriting Techniques and Applications pp 332–355Cite as

On the Connections between Rewriting and Formal Language Theory

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1631))

Abstract

Formal language theory, and in particular the theory of automata, has provided many tools that have been found extremely useful in rewriting theory, since automata can be used for deciding certain properties of rewriting systems as well as for constructing (weakly) confluent rewriting systems. On the other hand, rewriting theory has had some influence on the development of formal language theory, since based on certain rewriting systems some interesting classes of formal languages have been defined. Here a survey on some connections between rewriting and formal language theory is given, starting from the classical string languages and string-rewriting systems and continuing with tree automata and term-rewriting systems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.V. Book. Confluent and other types of Thue systems. Journal Association Computing Machinery, 29:171–182, 1982.

    MATH  MathSciNet  Google Scholar 

  2. R.V. Book. The power of the Church-Rosser property in string-rewriting systems. In D.W. Loveland, editor, 6th Conference on Automated Deduction, Lecture Notes in Computer Science 138, pages 360–368. Springer-Verlag, Berlin, 1982.

    Chapter  Google Scholar 

  3. R.V. Book. Decidable sentences of Church-Rosser congruences. Theoretical Computer Science, 24:301–312, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19:231–251, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.

    Google Scholar 

  6. W.J. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. In E.W. Mayr and C. Puech, editors, Proc. of STACS 95, Lecture Notes in Computer Science 900, pages 313–324. Springer-Verlag, Berlin, 1995.

    Google Scholar 

  8. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1–36, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  9. C.M. Campbell, E.F. Robertson, N. Ruškuc, and R.M. Thomas. Automatic semigroups. Technical Report No. 1997/29, Dep. of Mathematics and Computer Science, University of Leicester, 1997.

    Google Scholar 

  10. H. Comon. Sequentiality, second order monadic logic and tree automata. In Proceedings 10th Symposium on Logic in Computer Science, pages 508–517. IEEE Computer Society Press, San Diego, 1995.

    Google Scholar 

  11. J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: classiffication and connection with rewrite systems. Theoretical Computer Science, 127:69–98, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Dahlhaus and M. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal Computer System Sciences, 33:456–472, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Dauchet, A.-C. Caron, and J.-L. Coquidé. Automata for reduction properties solving. Journal of Symbolic Computation, 20:215–233, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88:187–201, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Dauchet and S. Tison. Decidability of confluence for ground term rewriting systems. In Fundamentals of Comp. Theory, Cottbus 1985, Lecture Notes in Computer Science 199, pages 80–89. Springer-Verlag, Berlin, 1985.

    Chapter  Google Scholar 

  16. M. Dauchet and S. Tison. The theory of ground rewriting systems is decidable. In J.C. Mitchell, editor, Proc. of 5th LICS, pages 242–248. IEEE Computer Society Press, Los Alamitos, CA, 1990.

    Google Scholar 

  17. M.D. Davis and E.J. Weyuker. Computability, Complexity, and Languages. Academic Press, New York, 1983.

    MATH  Google Scholar 

  18. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B.: Formal Models and Semantics, pages 243–320. Elsevier, Amsterdam, 1990.

    Google Scholar 

  19. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word Processing In Groups. Jones and Bartlett Publishers, Boston, 1992.

    MATH  Google Scholar 

  20. Z. Fulöp and S. Vágvölgyi. A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Fundamenta Informaticae, 13:211–226, 1990.

    MathSciNet  Google Scholar 

  21. J. Gallier and R.V. Book. Reductions in tree replacement systems. Theoretical Computer Science, 37:123–150, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  22. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.

    Google Scholar 

  23. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. III, pages 1–68. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  24. S.M. Gersten. Dehn functions and 1-norms of finite presentations. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classiffication in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 195–224. Springer-Verlag, New York, 1992.

    Google Scholar 

  25. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In C. Choffrut and M. Jantzen, editors, Proc. of STACS’91, Lecture Notes in Computer Science 480, pages 148–159. Springer-Verlag, 1991.

    Google Scholar 

  26. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157–175, 1995.

    Google Scholar 

  27. R. Gilman. Presentations of groups and monoids. Journal of Algebra, 57:544–554, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  28. P. Gyenizse and S. Vágvölgyi. Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science, 194:87–122, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  29. D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. Journal of Symbolic Computation, 17:91–129, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  30. D. Hofbauer and M. Huber. Test sets for the universal and existential closure of regular tree languages. This volume.

    Google Scholar 

  31. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.

    MATH  Google Scholar 

  32. G. Huet and D. Lankford. On the uniform halting problem for term rewriting systems. Lab. Report No. 283, INRIA, Le Chesnay, France, March 1978.

    Google Scholar 

  33. G. Huet and J.J. Lévy. Computations in orthogonal rewriting systems I and II. In J.L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 395–443. MIT Press, 1991. This paper was written in 1979.

    Google Scholar 

  34. F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proc. of RTA’96, Lecture Notes in Computer Science 1103, pages 362–376. Springer-Verlag, Berlin, 1996.

    Google Scholar 

  35. P. Jančar, F. Mráz, M. Plátek, and J. Vogel. On restarting automata with rewriting. In G. Páun and A. Salomaa, editors, New Trends in Formal Languages, Lecture Notes in Computer Science 1218, pages 119–136. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  36. D. Kapur. Shostak’s congruence closure as completion. In H. Comon, editor, Rewriting Techniques and Applications, Proc. of RTA’97, Lecture Notes in Computer Science 1232, pages 23–37. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  37. T. Kretschmer. A closure property of regular languages. Theoretical Computer Science, 61:283–287, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  38. G. Kucherov. On relationship between term rewriting systems and regular tree languages. In R.V. Book, editor, Rewriting Techniques and Applications, Proceedings RTA’91, Lecture Notes in Computer Science 488, pages 299–311. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  39. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Information and Computation, 118:91–100, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  40. N. Kuhn. Zur Entscheidbarkeit des Untergruppenproblems fur Gruppen mit kanonischen Darstellungen. Dissertation, Universitat Kaiserslautern, Fachbereich Informatik, 1991.

    Google Scholar 

  41. N. Kuhn and K. Madlener. A method for enumerating cosets of a group presented by a canonical system. In Proc. ISSAC’89, pages 338–350. ACM Press, New York, 1989.

    Google Scholar 

  42. N. Kuhn, K. Madlener, and F. Otto. A test for λ-confluence for certain preffix rewriting systems with applications to the generalized word problem. In S. Watanabe and M. Nagata, editors, Proceedings ISSAC’90, pages 8–15. ACM, New York, 1990.

    Google Scholar 

  43. N. Kuhn, K. Madlener, and F. Otto. Computing presentations for subgroups of polycyclic groups and of context-free groups. Applicable Algebra in Engineering, Communication and Computing, 5:287–316, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  44. K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. Theoretical Computer Science, 113:119–165, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  45. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35:324–344, 1988.

    MATH  MathSciNet  Google Scholar 

  46. P. Narendran and C. Ó’Dúnlaing. Cancellativity in finitely presented semigroups. Journal of Symbolic Computation, 7:457–472, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  47. P. Narendran and F. Otto. The problems of cyclic equality and conjugacy for finite complete rewriting systems. Theoretical Computer Science, 47:27–38, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  48. G. Niemann and F. Otto. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, editor, Foundations of Software Science and Computation Structures, Proceedings FoSSaCS’98, Lecture Notes in Computer Science 1378, pages 243–257. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  49. G. Niemann and F. Otto. Restarting automata, Church-Rosser languages, and confluent internal contextual languages. Mathematische Schriften Kassel 4/99, Universitat Kassel, March 1999.

    Google Scholar 

  50. F. Otto. Some undecidability results for non-monadic Church-Rosser Thue systems. Theoretical Computer Science, 33:261–278, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  51. F. Otto. On deciding the confluence of a finite string-rewriting system on a given congruence class. Journal Computer System Sciences, 35:285–310, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  52. F. Otto. Completing a finite special string-rewriting system on the congruence class of the empty word. Applicable Algebra in Engineering, Communication and Computing, 2:257–274, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  53. F. Otto. The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. Mathematical Systems Theory, 25:241–251, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  54. F. Otto. On Dehn functions of finitely presented bi-automatic monoids. Mathematische Schriften Kassel 8/98, Universitat Kassel, July 1998.

    Google Scholar 

  55. F. Otto. On s-regular preffix-rewriting systems and automatic structures. Mathematische Schriften Kassel 9/98, Universitat Kassel, September 1998.

    Google Scholar 

  56. F. Otto. Some undecidability results concerning the property of preserving regularity. Theoretical Computer Science, 207:43–72, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  57. F. Otto, M. Katsura, and Y. Kobayashi. Cross-sections for finitely presented monoids with decidable word problems. In H. Comon, editor, Rewriting Techniques and Applications, Proceedings RTA’97, Lecture Notes in Computer Science 1232, pages 53–67. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  58. F. Otto, M. Katsura, and Y. Kobayashi. Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. Journal of Symbolic Computation, 26:621–648, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  59. F. Otto, A. Sattler-Klein, and K. Madlener. Automatic monoids versus monoids with finite convergent presentations. In T. Nipkow, editor, Rewriting Techniques and Applications, Proceedings RTA’98, Lecture Notes in Computer Science 1379, pages 32–46. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  60. F. Otto and L. Zhang. Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Acta Informatica, 28:477–510, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  61. M. Oyamaguchi. The Church-Rosser property for ground term-rewriting systems is decidable. Theoretical Computer Science, 49:43–79, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  62. M. Oyamaguchi. NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems. SIAM Journal on Computing, 22:114–135, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  63. K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal Computer System Sciences, 37:367–394, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  64. K.M. Schimpf and J.H. Gallier. Tree pushdown automata. Journal Computer System Sciences, 30:25–40, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  65. R.E. Shostak. An algorithm for reasoning about equality. Communications of the Association for Computing Machinery, 21:583–585, 1978.

    Google Scholar 

  66. W. Snyder. Efficient ground completion: an O(n log n) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations E. In N. Deshowitz, editor, Rewriting Techniques and Applications, Proceedings RTA’89, Lecture Notes in Computer Science 355, pages 419–433. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  67. W. Snyder. A fast algorithm for generating reduced ground rewriting systems from a set of ground equations. Journal of Symbolic Computation, 15:415–450, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  68. J. Thatcher and J. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2:57–82, 1968.

    Article  MathSciNet  Google Scholar 

  69. S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. Bulletin of the EATCS, 48:197–209, 1992.

    MATH  Google Scholar 

  70. L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control, 25:123–133, 1974.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Kassel, D–34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F. (1999). On the Connections between Rewriting and Formal Language Theory. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

  • Online ISBN: 978-3-540-48685-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation