{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00178589","sets":["934:989:9056:9057"]},"path":["9057"],"owner":"11","recid":"178589","title":["能力の小さい1ビットセルオートマトンで生成可能な数列についての考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-03-20"},"_buckets":{"deposit":"73472376-39db-4afd-97d9-b99e8e34d4ff"},"_deposit":{"id":"178589","pid":{"type":"depid","value":"178589","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"能力の小さい1ビットセルオートマトンで生成可能な数列についての考察","author_link":["383003","383004","383002","383001"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"能力の小さい1ビットセルオートマトンで生成可能な数列についての考察"},{"subitem_title":"A Note on Sequences Generated by Small One-bit Cellular Automata","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] セルオートマトン，セル間通信量，複雑系，並列アルゴリズム，数列生成問題","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2017-03-20","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪電気通信大学"},{"subitem_text_value":"大阪電気通信大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka Electro-Communication University","subitem_text_language":"en"},{"subitem_text_value":"Osaka Electro-Communication University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/178589/files/IPSJ-TOM1001002.pdf","label":"IPSJ-TOM1001002.pdf"},"date":[{"dateType":"Available","dateValue":"2019-03-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1001002.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"893c1f6d-2943-4d62-9c19-5eeefe8c3cf8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"上川, 直紀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"梅尾, 博司"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoki, Kamikawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Umeo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"セルオートマトン（CA）はvon Neumannにより考案された並列計算モデルの1つであり，現在では，複雑系などの多くの分野で研究がなされている．CAはセルと呼ばれる有限状態オートマトンにより構成され，セルは自らと，隣接するセルの内部状態という局所的な情報をもとに，自らの内部状態を遷移させる機能しか持たない．しかしながら，この局所的な相互作用がモデル全体に影響を及ぼし，CAは巨大で複雑な事象をシミュレートすることができるという特徴を持つ．本稿では，セル間通信量を1ビットに制限されたモデルCA1-bit上で数列生成問題を考察し，内部状態が少ないCA1-bitで生成可能な数列について言及する．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A model of cellular automata (CA) is considered to be a well-studied non-linear model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. In this paper, we study a sequence generation problem on a special restricted class of cellular automata having 1-bit inter-cell communications (CA1-bit) and show that sequences can be generated in real-time by the CA1-bit with small internal states.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"13","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2017-03-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"10"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T05:03:45.974701+00:00","created":"2025-01-19T00:47:55.649679+00:00","id":178589}