Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
Yoshiharu KojimaMasahiko SakaiNaoki NishidaKeiichirou KusakariToshiki Sakabe
著者情報
ジャーナル フリー

2011 年 6 巻 4 号 p. 1185-1208

詳細
抄録

The reachability problem for an initial term, a goal term, and a rewrite system is to decide whether the initial term is reachable to goal one by the rewrite system or not. The innermost reachability problem is to decide whether the initial term is reachable to goal one by innermost reductions of the rewrite system or not. A context-sensitive term rewriting system (CS-TRS) is a pair of a term rewriting system and a mapping that specifies arguments of function symbols and determines rewritable positions of terms. In this paper, we show that both reachability for right-linear right-shallow CS-TRSs and innermost reachability for shallow CS-TRSs are decidable. We prove these claims by presenting algorithms to construct a tree automaton accepting the set of terms reachable from a given term by (innermost) reductions of a given CS-TRS.

著者関連情報
© 2011 Information Processing Society of Japan
前の記事 次の記事
feedback
Top