{"created":"2023-06-19T09:51:07.640703+00:00","id":8153,"links":{},"metadata":{"_buckets":{"deposit":"0b3ec64c-aa99-4568-b7b1-745e895ddc19"},"_deposit":{"created_by":3,"id":"8153","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"8153"},"status":"published"},"_oai":{"id":"oai:fukuyama-u.repo.nii.ac.jp:00008153","sets":["502:505:675:711"]},"author_link":["43768","43769","43770","43771","43772","43773","43767","43766","43774"],"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-12","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"238","bibliographicPageStart":"233","bibliographicVolumeNumber":"27","bibliographic_titles":[{"bibliographic_title":"福山大学工学部紀要"}]}]},"item_1_creator_6":{"attribute_name":"著者名(日)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"渡辺, 浩司"}],"nameIdentifiers":[{"nameIdentifier":"43766","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"猪飼, 武夫"}],"nameIdentifiers":[{"nameIdentifier":"43767","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"福永, 邦雄"}],"nameIdentifiers":[{"nameIdentifier":"43768","nameIdentifierScheme":"WEKO"}]}]},"item_1_description_1":{"attribute_name":"ページ属性","attribute_value_mlt":[{"subitem_description":"P(論文)","subitem_description_type":"Other"}]},"item_1_description_12":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"Regarding finite automata (FAs) as discrete time dynamical systems, they can be represented as state space models over B(={0,1}) similar to the representation method of linear systems over the real numbers (R) in the field of dynamical systems and controls. Based on this representation, we first propose a minimal realization method for deterministic FAs using Ho-Kalman's algorithm which is well-known method in the field of dynamical systems and controls. Since state space models of FAs are bilinear over B, and Ho-Kalman's algorithm is, on the other hand, one for linear system over R, we add some extensions to their algorithm. We next extend state space models of FAs to those over R, and call them real finite. automata. We then apply Ho-Kalman's algorithm to them.","subitem_description_type":"Other"}]},"item_1_full_name_7":{"attribute_name":"著者名よみ","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"43769","nameIdentifierScheme":"WEKO"}],"names":[{"name":"ワタナベ, コウジ"}]},{"nameIdentifiers":[{"nameIdentifier":"43770","nameIdentifierScheme":"WEKO"}],"names":[{"name":"イカイ, タケオ"}]},{"nameIdentifiers":[{"nameIdentifier":"43771","nameIdentifierScheme":"WEKO"}],"names":[{"name":"フクナガ, クニオ"}]}]},"item_1_full_name_8":{"attribute_name":"著者名(英)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"43772","nameIdentifierScheme":"WEKO"}],"names":[{"name":"WATANABE, Koji","nameLang":"en"}]},{"nameIdentifiers":[{"nameIdentifier":"43773","nameIdentifierScheme":"WEKO"}],"names":[{"name":"IKAI, Takeo","nameLang":"en"}]},{"nameIdentifiers":[{"nameIdentifier":"43774","nameIdentifierScheme":"WEKO"}],"names":[{"name":"FUKUNAGA, Kunio","nameLang":"en"}]}]},"item_1_source_id_13":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AN00217655","subitem_source_identifier_type":"NCID"}]},"item_1_text_10":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Department of Information Processing Engineering, Faculty of Engineering, Fukuyama University"},{"subitem_text_language":"en","subitem_text_value":"/"}]},"item_1_text_9":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_value":"福山大学工学部情報処理工学科"},{"subitem_text_value":"大阪府立大学大学院"},{"subitem_text_value":"大阪府立大学大学院"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2003-12-01"}],"displaytype":"detail","filename":"KJ00005781549.pdf","filesize":[{"value":"552.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fukuyama-u.repo.nii.ac.jp/record/8153/files/KJ00005781549.pdf"},"version_id":"15d1d07d-6c31-4df1-9d0b-19727bc0a5cc"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"実数有限オートマトン","subitem_subject_scheme":"Other"},{"subitem_subject":"状態空間モデル","subitem_subject_scheme":"Other"},{"subitem_subject":"最小実現","subitem_subject_scheme":"Other"},{"subitem_subject":"Ho-Kalmanアルゴリズム","subitem_subject_scheme":"Other"},{"subitem_subject":"real finite automata","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"state space model","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"minimal realization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Ho-Kalrian's algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現"},{"subitem_title":"Minimal Realization for Real Finite Automata using Ho-Kalman's Algorithm","subitem_title_language":"en"}]},"item_type_id":"1","owner":"3","path":["711"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-12-01"},"publish_date":"2003-12-01","publish_status":"0","recid":"8153","relation_version_is_last":true,"title":["Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-06-19T10:29:33.645618+00:00"}