{"created":"2021-09-10T02:26:15.261692+00:00","id":2001421,"links":{},"metadata":{"_buckets":{"deposit":"3488fe36-8d0e-459e-ad07-cf20bd698b04"},"_deposit":{"created_by":17,"id":"2001421","owner":"17","owners":[17],"owners_ext":{"displayname":"図書情報係","username":"repository"},"pid":{"revision_id":0,"type":"depid","value":"2001421"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:02001421","sets":["312:313:314"]},"author_link":[],"control_number":"2001421","item_1615768549627":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_1629683748249":{"attribute_name":"日付","attribute_value_mlt":[{"subitem_date_issued_datetime":"2023-01-04","subitem_date_issued_type":"Available"}]},"item_9_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2021-01-04","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"201","bibliographicPageStart":"185","bibliographicVolumeNumber":"850","bibliographic_titles":[{"bibliographic_title":"Theoretical Computer Science","bibliographic_titleLang":"en"}]}]},"item_9_description_4":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Register automata (RA) are a computational model that can handle data values by adding registers to finite automata. Recently, weighted register automata (WRA) were proposed by extending RA so that weights can be specified for transitions. In this paper, we first investigate decidability and complexity of decision problems on the weights of runs in WRA. We then propose an algorithm for the optimal run problem related to the above decision problems. For this purpose, we use a register type as an abstraction of the contents of registers, which is determined by binary relations (such as =, <, etc.) handled by WRA. Also, we introduce a subclass where both the applicability of transition rules and the weights of transitions are determined only by a register type. We present a method of transforming a given WRA satisfying the assumption to a weighted directed graph such that the optimal run of WRA and the minimum weight path of the graph correspond to each other. Lastly, we discuss the optimal run problem for weighted timed automata as an example.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_9_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Elsevier","subitem_publisher_language":"en"}]},"item_9_relation_43":{"attribute_name":"関連情報","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1016/j.tcs.2020.11.003","subitem_relation_type_select":"DOI"}}]},"item_9_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/","subitem_rights_language":"en"}]},"item_9_source_id_7":{"attribute_name":"収録物識別子","attribute_value_mlt":[{"subitem_source_identifier":"03043975","subitem_source_identifier_type":"PISSN"}]},"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":"Seki, Hiroyuki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yoshimura, Reo","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Takata, Yoshiaki","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-01-04"}],"displaytype":"detail","filename":"main-1101.pdf","filesize":[{"value":"468 KB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/2001421/files/main-1101.pdf"},"version_id":"dad9c440-ee89-4f32-9657-c603086c6d4d"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Weighted register automaton","subitem_subject_scheme":"Other"},{"subitem_subject":"Optimal run","subitem_subject_scheme":"Other"},{"subitem_subject":"Register type","subitem_subject_scheme":"Other"},{"subitem_subject":"Complexity","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":"Optimal run problem for weighted register automata","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Optimal run problem for weighted register automata","subitem_title_language":"en"}]},"item_type_id":"40001","owner":"17","path":["314"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2021-09-10"},"publish_date":"2021-09-10","publish_status":"0","recid":"2001421","relation_version_is_last":true,"title":["Optimal run problem for weighted register automata"],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2023-01-16T04:06:55.421646+00:00"}