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
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th 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
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
| Hi-index | 0.00 |
A reachability problem is a problem used to decide whether s is reachable to tby Ror not for a given two terms s, tand a term rewriting system R. Since it is known that this problem is undecidable, effort has been devoted to finding subclasses of term rewriting systems in which the reachability is decidable. However few works on decidability exist for innermost reduction strategy or context-sensitive rewriting.In this paper, we show that innermost reachability and contextsensitive reachability are decidable for linear right-shallow term rewriting systems. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties.