The reachability and related decision problems for monadic and semi-constructor TRSs

Authors:
Ichiro Mitsuhashi;Michio Oyamaguchi;Toshiyuki Yamada
Affiliations:
Faculty of Engineering, Mie University, 1577 Kurimamachiya-cho, Tsu-shi 514-0102, Japan;Faculty of Engineering, Mie University, 1577 Kurimamachiya-cho, Tsu-shi 514-0102, Japan;Faculty of Engineering, Mie University, 1577 Kurimamachiya-cho, Tsu-shi 514-0102, Japan
Venue:
Information Processing Letters
Year:
2006

Citing 3
Cited 3

Term rewriting and all that

Term rewriting and all that
Reachability and confluence are undecidable for flat term rewriting systems

Information Processing Letters
Algorithms and Reductions for Rewriting Problems

Fundamenta Informaticae

Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems

RTA'06 Proceedings of the 17th 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
New Undecidability Results for Properties of Term Rewrite Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper shows that reachability is undecidable for confluent monadic and semi-constructor TRSs, and that joinability and confluence are undecidable for monadic and semi-constructor TRSs. Here, a TRS is monadic if the height of the right-hand side of each rewrite rule is at most 1, and is semi-constructor if all defined symbols appearing in the right-hand side of each rewrite rule occur only in its ground subterms.