{"created":"2022-10-25T00:17:46.938068+00:00","id":2001210,"links":{},"metadata":{"_buckets":{"deposit":"f3601d53-359a-4172-9f7a-b88ca5249197"},"_deposit":{"id":"2001210","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2001210"},"status":"published"},"_oai":{"id":"oai:soar-ir.repo.nii.ac.jp:02001210","sets":["1221:1222"]},"author_link":[],"control_number":"2001210","item_1628147817048":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_6_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"388","bibliographicPageStart":"381","bibliographicVolumeNumber":"E104D","bibliographic_titles":[{"bibliographic_title":"IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS"}]}]},"item_6_description_20":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper presents a new method to translate a regular expression into a nondeterministic finite automaton (an NFA for short). Let r be a regular expression and let M be a Thompson automaton for r. We first introduce a labeled Thompson automaton defined by assigning two types of expressions which denote prefixes and suffixes of words in L(r) to each state of M. Then we give new ϵ-free NFAs constructed from a labeled Thompson automaton. These NFAs are called a prefix equation automaton and a suffix equation automaton. We show that a suffix equation automaton is isomorphic to an equation automaton defined by Antimirov. Furthermore we give an NFA called a unified equation automaton by joining two NFAs. Thus the number of states of a unified equation automaton can be smaller than that of an equation automaton.","subitem_description_type":"Abstract"}]},"item_6_description_30":{"attribute_name":"資源タイプ（コンテンツの種類）","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_type":"Other"}]},"item_6_description_5":{"attribute_name":"引用","attribute_value_mlt":[{"subitem_description":"IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E104D(3) : 381-388(2021)","subitem_description_type":"Other"}]},"item_6_link_3":{"attribute_name":"信州大学研究者総覧へのリンク","attribute_value_mlt":[{"subitem_link_text":"山本, 博章","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.ONfpOCSh.html"},{"subitem_link_text":"藤原, 洋志","subitem_link_url":"https://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html"}]},"item_6_relation_48":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"10.1587/transinf.2020FCP0010"}],"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1587/transinf.2020FCP0010","subitem_relation_type_select":"DOI"}}]},"item_6_rights_62":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© 2021 The Institute of Electronics, Information and Communication Engineers"}]},"item_6_source_id_35":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1745-1361","subitem_source_identifier_type":"EISSN"}]},"item_6_source_id_40":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10826272","subitem_source_identifier_type":"NCID"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yamamoto, Hiroaki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Fujiwara, Hiroshi","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-10-04"}],"filename":"16K00033_1.pdf","format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"16K00033_1.pdf","url":"https://soar-ir.repo.nii.ac.jp/record/2001210/files/16K00033_1.pdf"},"version_id":"b1341b44-8832-4f96-992c-5fc0fa2745ac"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"regular expression","subitem_subject_scheme":"Other"},{"subitem_subject":"nondeterministic finite automaton","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions","subitem_title_language":"en"}]},"item_type_id":"6","owner":"1","path":["1222"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2022-10-04"},"publish_date":"2022-10-04","publish_status":"0","recid":"2001210","relation_version_is_last":true,"title":["A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-12-14T04:15:31.093227+00:00"}