Linear generalized semi-monadic rewrite systems effectively preserve recognizability

Theoretical Computer Science

Volumn 194, Issue 1-2, 1998, Pages 87-122

  Gyenizse, Pál ^a   Vágvölgyi, Sándor ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011672242     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00333-7     Document Type: Article

References (20)

1. R.V. Book and F. Otto, String-Rewriting Systems (Springer, New York, 1993).
2. W.S. Brainerd, Tree generating regular systems, Inform and Control 14 (1969) 217-231.
3. A.C. Caron and J.L. Coquidé, Decidability of reachability for disjoint union of term rewriting systems, Theoret. Comput. Sci. 126 (1994) 31-52.
4. J.L. Coquidé, M. Dauchet, R. Gilleron and S. Vágvölgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoret. Comput. Sci. 127 (1994) 69-98.
5. M. Dauchet, P. Heuillard, P. Lescanne and S. Tison, Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems, Inform. and Control 88 (1990) 187-201.
6. M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable, in: Proc. 5th IEEE Symp. on Logic in Computer Science (Philadelphia, 1990) 242-248.
7. N. Dershowitz and J.P. Jouannaud, Rewrite systems, in: J.V. Leeuwen, ed., Handbook of Theoretical Computer Science, Vol B (North Holland, Amsterdam, 1990) 243-320.
8. Z. Fülöp, Undecidable properties of deterministic top-down tree transducers, Theoret. Comput. Sci. 134 (1994) 311-328.
9. Z. Fülöp and P. Gyenizse, On injectivity of deterministic top-down tree transducers, Inform. Process. Lett. 48 (1993) 183-188.
10. Z. Fülöp and S. Vágvölgyi, Congruential tree languages are the same as recognizable tree languages - A proof for a theorem of D. Kozen, Bull. EATCS 39 (1989) 175-185.
11. J.H. Gallier and R.V. Book, Reductions in tree replacement systems, Theoret. Comput. Sci. 37 (1985) 123-150.
12. F. Gécseg and M. Steinby, Tree Automata (Akadémiai Kiadó, Budapest, 1984).
13. F. Gécseg and M. Steinby, Tree Languages, in: G. Rozenberg and A. Salomaa eds., Handbook of Formal Language Theory (Springer, Berlin), to be published.
14. R. Gilleron, Decision problems for term rewriting systems and recognizable tree languages, Proc. STACS'91, Lecture Notes in Computer Science, Vol. 480 (Springer, Berlin, 1991) 148-159.
15. R. Gilleron and S. Tison, Regular tree languages and rewrite systems, Fund. Inform. 24 (1995) 157-175.
16. G. Huet, Confluent Reductions: Abstract properties and applications to term rewriting systems, J. ACM 27 (1980) 797-821.
17. D. Kozen, Complexity of finitely presented algebras, in: Proc. 9th Annual ACM Symp. on Theory of Computing (Boulder, CO, 1977) 164-177.
18. J.W. Lloyd, Foundations of Logic Programming (Springer, Berlin, extended edition, 1993).
19. F. Otto, On recognizability preserving string-rewriting systems, Manuscript, 1995.
20. K. Salomaa, Deterministic tree pushdown automata and monadic tree rewriting systems, J. Comput. System Sci. 37 (1988) 367-394.