WEKO3
アイテム
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
http://hdl.handle.net/2237/21164
http://hdl.handle.net/2237/21164d88394bd-baf0-45b0-b2f1-f2cf9a929a70
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO0203003.pdf (640.7 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2015-01-30 | |||||
| タイトル | ||||||
| タイトル | Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems | |||||
| 言語 | en | |||||
| 著者 |
Kojima, Yoshiharu
× Kojima, Yoshiharu× Sakai, Masahiko× Nishida, Naoki× Kusakari, Keiichirou× Sakabe, Toshiki |
|||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| 権利 | ||||||
| 言語 | ja | |||||
| 権利情報 | ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address editj＠ipsj.or.jp, please. | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | The reachability problem for given an initial term, a goal term, and a term rewriting system (TRS) is to decide whether the initial one is reachable to the goal one by the TRS or not. A term is shallow if each variable in the term occurs at depth 0 or 1. Innermost reduction is a strategy that rewrites innermost redexes, and context-sensitive reduction is a strategy in which rewritable positions are indicated by specifying arguments of function symbols. In this paper, we show that the reachability problem under context-sensitive innermost reduction is decidable for linear right-shallow TRSs. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties. We show a procedure to construct tree automata accepting the sets of terms reachable from a given term by context-sensitive innermost reduction of a given linear right-shallow TRS. | |||||
| 言語 | en | |||||
| 出版者 | ||||||
| 出版者 | 一般社団法人情報処理学会 | |||||
| 言語 | ja | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| 出版タイプ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| 関連情報 | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | URI | |||||
| 関連識別子 | http://id.nii.ac.jp/1001/00060663/ | |||||
| ISSN | ||||||
| 収録物識別子タイプ | PISSN | |||||
| 収録物識別子 | 0387-5806 | |||||
| 書誌情報 |
ja : 情報処理学会論文誌, プログラミング 巻 2, 号 3, p. 20-32, 発行日 2009-07 |
|||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| URI | ||||||
| 識別子 | http://id.nii.ac.jp/1001/00060663/ | |||||
| 識別子タイプ | URI | |||||
| URI | ||||||
| 識別子 | http://hdl.handle.net/2237/21164 | |||||
| 識別子タイプ | HDL | |||||
