Skip to main content
SpringerLink
Log in

Formal languages & word-rewriting

  • Conference paper
  • First Online:
Term Rewriting (TCS School 1993)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Autebert and L. Boasson. The equivalence of pre-NTS grammars is decidable. Math. Systems Theory 25, pages 61–74, 1992.

    Google Scholar 

  2. J.M. Autebert, P. Flajolet, and J. Gabarro. Prefixes of infinite words and ambiguous context-free languages. IPL 25 (4), 1986.

    Google Scholar 

  3. J.M. Autebert. Langages algébriques. Masson, 1987.

    Google Scholar 

  4. J. Berstel and L. Boasson. Context-free languages. In Handbook of theoretical computer science, vol. B, Chapter 2, pages 59–102. Elsevier, 1991.

    Google Scholar 

  5. C. Beeri. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305–320, 1976.

    Google Scholar 

  6. M. Benois. Parties rationnelles du groupe libre. C. R. Acad. Sci. série A, pages 1188–1190, 1969.

    Google Scholar 

  7. M. Benois. Descendants of regular language in a class of rewriting systems:algorithm and complexity of an automata construction. Proceedings RTA 87, LNCS 256, pages 121–132, 1987.

    Google Scholar 

  8. J. Berstel. Congruences plus que parfaites et langages algébriques. Séminaire d'informatique théorique de Paris 6–7, 1976–1977.

    Google Scholar 

  9. J. Berstel. Every iterated morphism yields a co-cfl. IPL 22, pages 7–9, 1986.

    Google Scholar 

  10. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. TCS 19, pages 231–251, 1982.

    Google Scholar 

  11. L. Boasson and M. Nivat. Centers of context-free languages. LITP technical report no 84-44, 1984.

    Google Scholar 

  12. R.V. Book and F. Otto. Cancellation rules and extended word problems. IPL 20, pages 5–11, 1985.

    Google Scholar 

  13. R.V. Book and F. Otto. String Rewriting Systems. Texts and monographs in Computer Science. Springer-Verlag, 1993.

    Google Scholar 

  14. L. Boasson. Grammaires à non-terminaux séparés. In Proceedings 7th ICALP, pages 105–118. LNCS 85, 1980.

    Google Scholar 

  15. R.V. Book. Thue systems as rewriting systems. J. Symbolic Computation. 3, pages 39–68, 1987.

    Google Scholar 

  16. M. Benois and J. Sakarovitch. On the complexity of some extended word problems defined by cancellation rules. IPL 23, pages 281–287, 1986.

    Google Scholar 

  17. J.R. Büchi. Regular canonical systems. Archiv fur Math. Logik und Grund-lagenforschung 6, pages 91–111, 1964.

    Google Scholar 

  18. J.R. Büchi. Regular canonical systems, the collected works of J.R. Buchi, pages 317–337, 1990.

    Google Scholar 

  19. P. Butzbach. Sur l'équivalence des grammaires simples. In Actes des Premières journées d'informatique Théorique, Bonascre. ENSTA, 1973.

    Google Scholar 

  20. P. Butzbach. Une famille de congruences de Thue pour lesquelles l'équivalence est décidable. In Proceedings 1rst ICALP, pages 3–12. LNCS, 1973.

    Google Scholar 

  21. A.C. Caron. Linear bounded automata and rewrite systems: influence of initial configurations on decision properties. In Proceedings CAAP 91, pages 74–89. LNCS, Springer-Verlag, 1991.

    Google Scholar 

  22. D. Caucal. Recritures suffixes de mots. Internal report IRISA nr 413, 1988.

    Google Scholar 

  23. D. Caucal. A fast algorithm to decide on simple grammars equivalence. L.N.C.S., Vol. 401, pages 66–85, 1989.

    Google Scholar 

  24. D. Caucal. A fast algorithm to decide on the equivalence of stateless dpda. RAIRO Theoret. Infor. and App., pages 23–48, 1993.

    Google Scholar 

  25. L. Chottin. Strict deterministic languages and controlled rewriting systems. In Proceedings 6th ICALP. LNCS Springer-Verlag, 1979.

    Google Scholar 

  26. L. Chottin. Langages algébriques et systèmes de réécriture rationnels. RAIRO Inform. Téor. 16, pages 1–20, 1982.

    Google Scholar 

  27. Y. Cochet and M. Nivat. Une généralisation des ensembles de Dyck. Israel J. of Math. vol.9, n 3, 1971.

    Google Scholar 

  28. Y. Cochet. Sur l'algébricité des classes de certaines congruences définies sur le monoide libre. Thèse de l'université de Rennes, 1971.

    Google Scholar 

  29. Y. Cochet. Congruences quasi-parfaites et langages rationnels. Manuscrit non-publié, 1975.

    Google Scholar 

  30. Y. Cochet. Langages définis par des congruences. Groupe d'étude d'Algèbre, 1ère année, no 16, pages 1–7, 1975/76.

    Google Scholar 

  31. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Handbook of theoretical computer science, vol. B, Chapter 2, pages 243–320. Elsevier, 1991.

    Google Scholar 

  32. A. Ehrenfeucht, D. Haussler, and G. Rozenberg. On regularity of context-free languages. T.C.S. 27, pages 311–322, 1983.

    Google Scholar 

  33. S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control 9, pages 620–648, 1966.

    Google Scholar 

  34. S. Greibach. A note on pushdown store automaton and regular systems. Proc. Amer. Math. Soc., pages 263–268, 1967.

    Google Scholar 

  35. M.A. Harrison. Introduction To Formal Language Theory. Addison-Wesley, 1978.

    Google Scholar 

  36. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  37. G. Huet. Confluent reductions:abstract properties and applications to term rewriting systems. JACM vol. 27 no 4, pages 797–821, 1980.

    Google Scholar 

  38. M. Jantzen. Confluent String Rewriting (EATCS monograph). Springer-Verlag, 1988.

    Google Scholar 

  39. F. Kierszenbaum. Les langages à opérateurs d'insertion. These de Sième cycle, université Bordeaux I, 1979.

    Google Scholar 

  40. W. Kuich and A. Salomaa. Semirings, Automata, Languages (EATCS monograph). Springer-Verlag, 1986.

    Google Scholar 

  41. G. Lallement. The word problem for Thue systems. In Actes de l'école de printemps d'informatique théorique, Font-Romeu 93. Springer-Verlag, 1994.

    Google Scholar 

  42. Y. Lafont and A. Prouté. Church-Rosser property and homology of monoids. In Actes de l'école de printemps d'informatique théorique, Font-Romeu 93. Springer-Verlag, 1994.

    Google Scholar 

  43. Y. Matiyasevich. Word problem for Thue systems with a few relations. In Actes de l'école de printemps d'informatique théorique, Font-Romeu 93. Springer-Verlag, 1994.

    Google Scholar 

  44. R. McCloskey. Bounded context grammars and languages. PHD, 1993.

    Google Scholar 

  45. R. McNaughton. Parenthesis grammars. JACM 14, pages 490–500, 1967.

    Google Scholar 

  46. M. Morse and G.A. Hedlung. Unending chess, symbolic dynamics and a problem in semi-groups. Duke Math. J. 11, pages 1–7, 1944.

    Google Scholar 

  47. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. JACM 35(2), pages 324–344, 1988.

    Google Scholar 

  48. K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. T.C.S. 113, pages 119–165, 1993.

    Google Scholar 

  49. K. Madlener and F. Otto. About the descriptive power of certain classes of finite string-rewriting systems. T.C.S. 67, pages 143–172, 1989.

    Google Scholar 

  50. P. Narendran. On the equivalence problem for regular Thue systems. TCS 44, pages 237–245, 1986.

    Google Scholar 

  51. P. Narendran. It is decidable whether a monadic Thue system is canonical over a regular set. Math. Systems Theory 23, pages 245–254, 1990.

    Google Scholar 

  52. M. Nivat and M. Benois. Congruences parfaites et quasi-parfaites. Séminaire Dubreil, 2ième année, no 7, 1971/72.

    Google Scholar 

  53. M. Nivat. On some families of languages related to the Dyck language. 2nd Annual Symposium on Theory of Computing, 1970.

    Google Scholar 

  54. M. Nivat. Congruences de Thue et t-langages. Studia Scientiarum Mathematicarum Hungarica 6, pages 243–249, 1971.

    Google Scholar 

  55. P. Narendran, C. O'Dunlaing, and H. Rolletschek. Complexity of certain decision problems about congruential languages. JCSS 30, pages 343–358, 1986.

    Google Scholar 

  56. C. O'Dunlaing. Finite and infinite regular Thue systems. PHD University of California at Santa Barbara, 1981.

    Google Scholar 

  57. C. O'Dunlaing. Infinite regular thue systems. TCS 2, pages 171–192, 1983.

    Google Scholar 

  58. M. Oyamaguchi, Y. Inagaki, and N. Honda. The equivalence problem for two dpda's one of which is a finite-turn or one-counter machine. J. Comput. System Sci.23, nr 3, pages 366–382, 1981.

    Google Scholar 

  59. F. Otto. Some undecidability results for non-monadic Church-Rosser Thue systems. TCS 33, pages 261–278, 1984.

    Google Scholar 

  60. F. Otto. On deciding the confluence of a finite string-rewriting system on a given congruence class. JCSS 35, pages 285–310, 1987.

    Google Scholar 

  61. F. Otto. Completing a finite special string-rewriting system on the congruence class of the empty word. Applicable Algebra in Engeneering Comm. Comput. 2, pages 257–274, 1992.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  64. F. Romian and J. Sakarovitch. One-sided Dyck reduction over two letters and deterministic context-free languages. In Proceedings MFCS 86, pages 554–563. Springer-Verlag, LNCS 233, 1986.

    Google Scholar 

  65. J. Sakarovitch. Syntaxe des langages de Chomsky, essai sur le déterminisme. Thèse de doctorat d'état de l'université Paris VII, pages 1–175, 1979.

    Google Scholar 

  66. A. Salomaa. Formal Languages. Academic Press, 1973.

    Google Scholar 

  67. G. Sénizergues. Décidabilité de l'équivalence des grammaires NTS. Thèse de 3ième cycle, université Paris 7, pages 1–170, 1981.

    Google Scholar 

  68. G. Sénizergues. The equivalence and inclusion problems for NTS languages. J. Comput. System Sci. 31 (3), pages 303–331, 1985.

    Google Scholar 

  69. G. Sénizergues. On the rational subsets of the free group. LITP internal report nr 86-3, submitted to Acta Informatica, pages 1–17, 1986.

    Google Scholar 

  70. G. Sénizergues. Sur la description des langages algébriques déterministes par des systèmes de réécriture confluents. Thèse d'état, université Paris 7 et rapport LITP 88-39, pages 1–330, 1987.

    Google Scholar 

  71. G. Sénizergues. Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages. Information and Computation 81 (3), pages 265–279, 1989.

    Google Scholar 

  72. G. Sénizergues. A characterisation of deterministic context-free languages by means of right-congruences. TCS 70 (2), pages 213–232, 1990.

    Google Scholar 

  73. G. Sénizergues. Some decision problems about controlled rewriting systems. TCS 71, pages 281–346, 1990.

    Google Scholar 

  74. M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control 27, pages 1–35, 1975.

    Google Scholar 

  75. A. Thue. Uber die gegenseitiges lage gleicher teile gewisser zeichenreihen. Skr. Vid. Kristiania, I Mat. Naturv. Klasse nr 8, pages 1–67, 1912.

    Google Scholar 

  76. A. Thue. Probleme über veränderungen von zeichenreihen nach gegeben regeln. Skr. Vid. Kristiania, I Mat. Naturv. Klasse nr 10, page 34 pp, 1914.

    Google Scholar 

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

    Google Scholar 

  78. L. Zhang. The pre-NTS property is undecidable for context-free grammars. IPL 44, pages 181–184, 1992.

    Google Scholar 

Download references

Author information

Author notes

  1. Géraud Sénizergues

    Present address: LaBRI & UER Math-info, Université Bordeaux I, 351, cours de la Libération, 33405, Talence Cedex, France

Authors and Affiliations

  1. LaBRI (the laboratory at Bordeaux for research in computing), Université de Bordeaux I, France

    Géraud Sénizergues

Authors
  1. Géraud Sénizergues
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon Jean-Pierre Jounnaud

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sénizergues, G. (1995). Formal languages & word-rewriting. In: Comon, H., Jounnaud, JP. (eds) Term Rewriting. TCS School 1993. Lecture Notes in Computer Science, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59340-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-59340-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59340-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation