Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
スポンサーリンク
概要
- 論文の詳細を見る
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-09-22
著者
-
Masahiko Sakai
Graduate School of Information Science, Nagoya University
-
Masahiko Sakai
Graduate School Of Information Science Nagoya University
-
Keiichirou Kusakari
Graduate School Of Information Science Nagoya University
-
Naoki Nishida
Graduate School Of Information Science Nagoya University
-
Toshiki Sakabe
Graduate School Of Information Science Nagoya University
-
Yoshiharu Kojima
Graduate School Of Information Science Nagoya University|research Fellow Of The Japan Society For Th
関連論文
- Recognizability of Redexes for Higher-Order Rewrite Systems
- Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
- Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
- Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
- Determinization of Conditional Term Rewriting Systems for Program Generation
- Argument Filterings and Usable Rules in Higher-order Rewrite Systems