Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
On ground-confluence of term rewriting systems
Information and Computation
The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Confluence, ground confluence, and termination of monadic term rewriting systems
Journal of Information Processing and Cybernetics
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Term rewriting and all that
Some undecidability results concerning the property of preserving regularity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The unification problem for confluent right-ground term rewriting systems
Information and Computation - RTA 2001
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems
Applicable Algebra in Engineering, Communication and Computing
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.89 |
The union of a monadic and a right-ground term rewrite system is called a murg term rewrite system. We show that for murg TRSs the ground common ancestor problem is undecidable. We show that for a murg term rewrite system it is undecidable whether the set of descendants of a ground tree is a recognizable tree language. We show that it is undecidable whether a murg term rewrite system over @S preserves @S-recognizability.