WEKO3
インデックスリンク
アイテム
{"_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": ["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\u0027s 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\u0027s 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\u0027s 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", "download_preview_message": "", "file_order": 0, "filename": "KJ00005781549.pdf", "filesize": [{"value": "552.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 552800.0, "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\u0027s 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\u0027s Algorithm", "subitem_title_language": "en"}]}, "item_type_id": "1", "owner": "3", "path": ["711"], "permalink_uri": "https://fukuyama-u.repo.nii.ac.jp/records/8153", "pubdate": {"attribute_name": "公開日", "attribute_value": "2003-12-01"}, "publish_date": "2003-12-01", "publish_status": "0", "recid": "8153", "relation": {}, "relation_version_is_last": true, "title": ["Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現"], "weko_shared_id": -1}
Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現
https://fukuyama-u.repo.nii.ac.jp/records/8153
https://fukuyama-u.repo.nii.ac.jp/records/815370b49dec-fb4a-4945-8dc5-bf8cc403e34a
名前 / ファイル | ライセンス | アクション |
---|---|---|
KJ00005781549.pdf (552.8 kB)
|
|
Item type | 紀要論文(ELS) / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2003-12-01 | |||||
タイトル | ||||||
タイトル | Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Minimal Realization for Real Finite Automata using Ho-Kalman's Algorithm | |||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 実数有限オートマトン | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 状態空間モデル | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 最小実現 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Ho-Kalmanアルゴリズム | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | real finite automata | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | state space model | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | minimal realization | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Ho-Kalrian's algorithm | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
ページ属性 | ||||||
内容記述タイプ | Other | |||||
内容記述 | P(論文) | |||||
著者名(日) |
渡辺, 浩司
× 渡辺, 浩司× 猪飼, 武夫× 福永, 邦雄 |
|||||
著者名よみ | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43769 | |||||
姓名 | ワタナベ, コウジ | |||||
著者名よみ | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43770 | |||||
姓名 | イカイ, タケオ | |||||
著者名よみ | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43771 | |||||
姓名 | フクナガ, クニオ | |||||
著者名(英) | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43772 | |||||
姓名 | WATANABE, Koji | |||||
言語 | en | |||||
著者名(英) | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43773 | |||||
姓名 | IKAI, Takeo | |||||
言語 | en | |||||
著者名(英) | ||||||
識別子Scheme | WEKO | |||||
識別子 | 43774 | |||||
姓名 | FUKUNAGA, Kunio | |||||
言語 | en | |||||
著者所属(日) | ||||||
値 | 福山大学工学部情報処理工学科 | |||||
著者所属(日) | ||||||
値 | 大阪府立大学大学院 | |||||
著者所属(日) | ||||||
値 | 大阪府立大学大学院 | |||||
著者所属(英) | ||||||
言語 | en | |||||
値 | Department of Information Processing Engineering, Faculty of Engineering, Fukuyama University | |||||
著者所属(英) | ||||||
言語 | en | |||||
値 | / | |||||
抄録(英) | ||||||
内容記述タイプ | Other | |||||
内容記述 | 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. | |||||
雑誌書誌ID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AN00217655 | |||||
書誌情報 |
福山大学工学部紀要 巻 27, p. 233-238, 発行日 2003-12 |