On the connections between rewriting and formal language theory

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

Volumn 1631, Issue , 1999, Pages 332-355

  Otto, Friedrich ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES;

FORMAL LANGUAGE THEORY; REWRITING SYSTEMS; REWRITING THEORY; STRING LANGUAGES; STRING REWRITING; TERM REWRITING SYSTEMS; TREE AUTOMATA;

COMPUTATIONAL LINGUISTICS;

EID: 84957673589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_27     Document Type: Conference Paper

References (70)

1. R.V. Book. Confluent and other types of Thue systems. Journal Association Computing Machinery, 29:171-182, 1982.
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.
3. R.V. Book. Decidable sentences of Church-Rosser congruences. Theoretical Computer Science, 24:301-312, 1983.
4. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19:231-251, 1982.
5. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
6. W.J. Brainerd. Tree generating regular systems. Information and Control, 14:217-231, 1969.
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.
8. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1-36, 1998.
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.
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.
11. J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science, 127:69-98, 1994.
12. E. Dahlhaus and M. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal Computer System Sciences, 33:456-472, 1986.
13. M. Dauchet, A.-C. Caron, and J.-L. Coquidé. Automata for reduction properties solving. Journal of Symbolic Computation, 20:215-233, 1995.
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.
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.
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.
17. M.D. Davis and E.J. Weyuker. Computability, Complexity, and Languages. Academic Press, New York, 1983.
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.
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.
20. Z. Fülö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.
21. J. Gallier and R.V. Book. Reductions in tree replacement systems. Theoretical Computer Science, 37:123-150, 1985.
22. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
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.
24. S.M. Gersten. Dehn functions and l1-norms of finite presentations. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 195-224. Springer-Verlag, New York, 1992.
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.
26. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157-175, 1995.
27. R. Gilman. Presentations of groups and monoids. Journal of Algebra, 57:544-554, 1979.
28. P. Gyenizse and S. Vágvölgyi. Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science, 194:87-122, 1998.
29. D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. Journal of Symbolic Computation, 17:91-129, 1994.
30. D. Hofbauer and M. Huber. Test sets for the universal and existential closure of regular tree languages. This volume.
31. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.
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.
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.
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.
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.
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.
37. T. Kretschmer. A closure property of regular languages. Theoretical Computer Science, 61:283-287, 1988.
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.
39. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Information and Computation, 118:91-100, 1995.
40. N. Kuhn. Zur Entscheidbarkeit des Untergruppenproblems für Gruppen mit kanonischen Darstellungen. Dissertation, Universität Kaiserslautern, Fachbereich Informatik, 1991.
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.
42. N. Kuhn, K. Madlener, and F. Otto. A test for λ-confluence for certain prefix 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.
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.
44. K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. Theoretical Computer Science, 113:119-165, 1993.
45. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35:324-344, 1988.
46. P. Narendran and C. Ó'Dúnlaing. Cancellativity in finitely presented semigroups. Journal of Symbolic Computation, 7:457-472, 1989.
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.
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.
49. G. Niemann and F. Otto. Restarting automata, Church-Rosser languages, and confluent internal contextual languages. Mathematische Schriften Kassel 4/99, Universität Kassel, March 1999.
50. F. Otto. Some undecidability results for non-monadic Church-Rosser Thue systems. Theoretical Computer Science, 33:261-278, 1984.
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.
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.
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.
54. F. Otto. On Dehn functions of finitely presented bi-automatic monoids. Mathematische Schriften Kassel 8/98, Universität Kassel, July 1998.
55. F. Otto. On s-regular prefix-rewriting systems and automatic structures. Mathematische Schriften Kassel 9/98, Universität Kassel, September 1998.
56. F. Otto. Some undecidability results concerning the property of preserving regularity. Theoretical Computer Science, 207:43-72, 1998.
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.
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.
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.
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.
61. M. Oyamaguchi. The Church-Rosser property for ground term-rewriting systems is decidable. Theoretical Computer Science, 49:43-79, 1987.
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.
63. K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal Computer System Sciences, 37:367-394, 1988.
64. K.M. Schimpf and J.H. Gallier. Tree pushdown automata. Journal Computer System Sciences, 30:25-40, 1985.
65. R.E. Shostak. An algorithm for reasoning about equality. Communications of the Association for Computing Machinery, 21:583-585, 1978.
66. W. Snyder. Effcient 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.
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.
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.
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.
70. L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control, 25:123-133, 1974.