Some undecidability results concerning the property of preserving regularity

Theoretical Computer Science

Volumn 207, Issue 1, 1998, Pages 43-72

  Otto, Friedrich ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

Regularity preserving; Rewriting systems; Sets of descendants; Sets of normal forms; String rewriting

Indexed keywords

EID: 0008402892     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00055-3     Document Type: Article

References (27)

1. A.V. Anissimov, Group languages, Cybernetics 7 (1971) 594-601.
2. R.V. Book, The power of the Church-Rosser property in string-rewriting systems, in: D.W. Loveland (Ed.), Proc. 6th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 138, Springer, Berlin, 1982, pp. 360-368.
3. R.V. Book, M. Jantzen, C. Wrathall, Monadic Thue systems, Theoret. Comput. Sci. 19 (1982) 231-251.
4. R.V. Book, F. Otto, String-Rewriting Systems, Springer, New York, 1993.
5. W.J. Brainerd, Tree generating regular systems, Inform. and Control 14 (1969) 217-231.
6. J.-L. Coquidé, M. Dauchet, R. Gilleron, S. Vágvölgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoret. Comput. Sci. 127 (1994) 69-98.
7. M. Dauchet, Simulation of Turing machines by a left-linear rewrite rule, in: N. Dershowitz (Ed.), Proc. Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 355, Springer, Berlin, 1989, pp. 109-120.
8. J. Gallier, R.V. Book, Reductions in tree replacement systems, Theoret. Comput. Sci. 37 (1985) 123-150.
9. F. Gécseg, M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
10. F. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. III, Springer, Berlin, 1997, pp. 1-68.
11. R. Gilleron, Decision problems for term rewriting systems and recognizable tree languages, in: C. Choffrut, M. Jantzen (Eds.), Proc. STACS'91, Lecture Notes in Computer Science, vol. 480, Springer, Berlin, 1991, pp. 148-159.
12. R. Gilleron, S. Tison, Regular tree languages and rewrite systems, Fundam. Inform. 24 (1995) 157-175.
13. S. Greibach, A note on pushdown store automata and regular systems, Proc. Amer. Math. Soc. 18 (1967) 263-268.
14. P. Gyenizse, S. Vágvölgyi, Linear generalized semi-monadic rewrite systems effectively preserve recognizability, Theoret. Comput. Sci. 194 (1998) 87-122.
15. P.K. Hooper, The undecidability of the Turing machine immortality problem, J. Symbol. Logic 31 (1966) 219-234.
16. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
17. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, The undecidability of the semi-unification problem, Inform. and Comput. 102 (1993) 83-101.
18. T. Kretschmer, A closure property of regular languages, Theoret. Comput. Sci. 61 (1988) 283-287.
19. R.C. Lyndon, P.E. Schupp, Combinatorial Group Theory, Springer, Berlin, 1977.
20. K. Madlener, F. Otto, Groups presented by certain classes of finite length-reducing string-rewriting systems, in: P. Lescanne (Ed.), Proc. Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 256, Springer, Berlin, 1987, pp. 133-144.
21. C. Ó'Dúnlaing, Finite and infinite regular Thue systems, Ph.D. Thesis, University of California, Santa Barbara, 1981.
22. F. Otto, Some undecidability results for non-monadic Church-Rosser Thue systems, Theoret. Comput. Sci. 33 (1984) 261-278.
23. F. Otto, When is an extension of a specification consistent? Decidable and undecidable cases, J. Symbol. Comput. 12 (1991) 255-273.
24. J. Sakarovitch, Syntaxe des langages de Chomsky, essai sur le déterminisme, Thèse de doctorat d'état de l'université Paris VII, 1979.
25. K. Salomaa, Deterministic tree pushdown automata and monadic tree rewriting systems, J. Comput. Syst. Sci. 37 (1988) 367-394.
26. G. Sénizergues, Some decision problems about controlled rewriting systems, Theoret. Comput. Sci. 71 (1990) 281-346.
27. M. Wirsing, Algebraic specification, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B.: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 675-788.