{"_buckets": {"deposit": "6ad280ad-d60d-4231-a81e-965586bf707e"}, "_deposit": {"id": "19073", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19073"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019073", "sets": ["1351"]}, "author_link": ["55728", "55729"], "control_number": "19073", "item_21_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2008", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "201", "bibliographicPageStart": "187", "bibliographicVolumeNumber": "5117", "bibliographic_titles": [{"bibliographic_title": "Rewriting Techniques and Applications, Lecture Notes in Computer Science", "bibliographic_titleLang": "en"}]}]}, "item_21_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "A reachability problem is a problem used to decide whether s is reachable to t by R or not for a given two terms s, t and a term rewriting system R. Since it is known that this problem is undecidable, effort has been devoted to finding subclasses of term rewriting systems in which the reachability is decidable. However few works on decidability exist for innermost reduction strategy or context-sensitive rewriting. In this paper, we show that innermost reachability and contextsensitive reachability are decidable for linear right-shallow term rewriting systems. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_21_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008 Proceedings", "subitem_description_language": "en", "subitem_description_type": "Other"}]}, "item_21_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21175"}]}, "item_21_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer", "subitem_publisher_language": "en"}]}, "item_21_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1007/978-3-540-70590-1_13", "subitem_relation_type_select": "DOI"}}]}, "item_21_relation_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_relation_type": "isPartOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "0302-9743", "subitem_relation_type_select": "PISSN"}}]}, "item_21_relation_8": {"attribute_name": "ISBN", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "978-3-540-70588-8", "subitem_relation_type_select": "ISBN"}}]}, "item_21_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-70590-1_13", "subitem_rights_language": "en"}]}, "item_21_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Kojima, Yoshiharu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55728", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55729", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-21"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "rta08.pdf", "filesize": [{"value": "228.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 228700.0, "url": {"label": "rta08.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/19073/files/rta08.pdf"}, "version_id": "6870c318-5b70-4e27-9343-8dca6adc9f0a"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "book part", "resourceuri": "http://purl.org/coar/resource_type/c_3248"}]}, "item_title": "Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems", "subitem_title_language": "en"}]}, "item_type_id": "21", "owner": "1", "path": ["1351"], "permalink_uri": "http://hdl.handle.net/2237/21175", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2015-02-04"}, "publish_date": "2015-02-04", "publish_status": "0", "recid": "19073", "relation": {}, "relation_version_is_last": true, "title": ["Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems"], "weko_shared_id": -1}