WEKO3
アイテム
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
https://ipsj.ixsq.nii.ac.jp/records/77591
https://ipsj.ixsq.nii.ac.jp/records/7759125d47a8e-abda-4ce8-a235-18b2dce7f87b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO0404003.pdf (509.2 kB)
|
Copyright (c) 2011 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2011-09-22 | |||||||
| タイトル | ||||||||
| タイトル | Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 通常論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Graduate School of Information Science, Nagoya University／Research Fellow of the Japan Society for the Promotion of Science | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science, Nagoya University / Research Fellow of the Japan Society for the Promotion of Science | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science, Nagoya University | ||||||||
| 著者名 |
Yoshiharu, Kojima
Masahiko, Sakai
Naoki, Nishida
Keiichirou, Kusakari
Toshiki, Sakabe
× Yoshiharu, Kojima Masahiko, Sakai Naoki, Nishida Keiichirou, Kusakari Toshiki, Sakabe
|
|||||||
| 著者名(英) |
Yoshiharu, Kojima
Masahiko, Sakai
Naoki, Nishida
Keiichirou, Kusakari
Toshiki, Sakabe
× Yoshiharu, Kojima Masahiko, Sakai Naoki, Nishida Keiichirou, Kusakari Toshiki, Sakabe
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11464814 | |||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 4, 号 4, p. 12-35, 発行日 2011-09-22 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7802 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
