The Church-Rosser property for ground term-rewriting systems is decidable
Theoretical Computer Science
Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Information and Computation
The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Handbook of theoretical computer science (vol. B)
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Term rewriting and all that
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Confluence of shallow right-linear rewrite systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Unique Normalization for Shallow TRS
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Termination of rewriting with right-flat rules
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each rewrite rule are at most one.