WEKO3
アイテム
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
http://hdl.handle.net/2237/9238
http://hdl.handle.net/2237/92385dd78a7c-5449-4f67-923a-2692a7543822
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-04 | |||||
タイトル | ||||||
タイトル | Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems | |||||
言語 | en | |||||
著者 |
Uchiyama, Keita
× Uchiyama, Keita× Sakai, Masahiko× Sakabe, Toshiki |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
抄録 | ||||||
内容記述 | Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and μ-termination are decidable properties for the class of semi-constructor TRSs. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
書誌情報 |
en : Proceedings of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007) Paris p. 16-27, 発行日 2007-06 |
|||||
フォーマット | ||||||
application/pdf | ||||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/9238 | |||||
識別子タイプ | HDL |