{"created":"2025-02-21T03:39:49.194792+00:00","id":2007050,"links":{},"metadata":{"_buckets":{"deposit":"37ed9338-ae6c-4a07-af58-115be7100bd3"},"_deposit":{"created_by":41,"id":"2007050","owners":[41],"pid":{"revision_id":0,"type":"depid","value":"2007050"},"status":"published"},"_oai":{"id":"oai:hiroshima.repo.nii.ac.jp:02007050","sets":["1730444907710"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata","subitem_title_language":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Morita, Kenichi","creatorNameLang":"en"}],"familyNames":[{"familyName":"Morita","familyNameLang":"en"}],"givenNames":[{"givenName":"Kenichi","givenNameLang":"en"}]},{"creatorNames":[{"creatorName":"Ueno, Satoshi","creatorNameLang":"en"}],"familyNames":[{"familyName":"Ueno","familyNameLang":"en"}],"givenNames":[{"givenName":"Satoshi","givenNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186499011":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_rights":"Copyright (c) 1992 IEICE"}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"cellular automata","subitem_subject_scheme":"Other"},{"subitem_subject":"reversibility","subitem_subject_scheme":"Other"},{"subitem_subject":"computational universality","subitem_subject_scheme":"Other"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"A reversible (or injective) cellular automaton (RCA) is a \"backward deterministic\" CA, i.e., every configuration of it has at most one predecessor. Margolus has been shown that there is a computation-universal two-dimensional 2-state RC A model. Although his model is very interesting, it differs from a standard CA model because of its somewhat spatial and temporal non-uniformity. In this paper, we present two kinds of simple 16-state computation-universal models using the framework of two-dimensional reversible partitioned CA (PCA). Since PCA can be considered as a subclass of standard CA, we can immediately obtain 16-state standard RCA models from them. For each of these models, we designed a configuration which simulates a Fredkin gate. Since Fredkin gate has been known to be a universal logic element, computation-universality of these two models is concluded.","subitem_description_language":"en"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_1617186920753":{"attribute_name":"Source Identifier","attribute_value_mlt":[{"subitem_source_identifier":"AA10826272","subitem_source_identifier_type":"NCID"},{"subitem_source_identifier":"0916-8532","subitem_source_identifier_type":"ISSN"}]},"item_1617187024783":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"141"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1992-01-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"147","bibliographicPageStart":"141","bibliographicVolumeNumber":"E75-D","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Information and Systems"},{"bibliographic_title":"IEICE Transactions on Information and Systems"}]}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_1617353299429":{"attribute_name":"Relation","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/bin/summary.php?id=e75-d_1_141&category=D&lang=E&year=1992&abst=","subitem_relation_type_select":"URI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2023-03-18"}],"displaytype":"simple","filename":"TransIEICE_E75-1_141.pdf","filesize":[{"value":"529.5 KB"}],"mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://hiroshima.repo.nii.ac.jp/record/2007050/files/TransIEICE_E75-1_141.pdf"},"version_id":"99760c69-c9fe-4882-8f39-0df439defd42"}]},"item_1732771732025":{"attribute_name":"旧ID","attribute_value":"48451"},"item_title":"Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata","item_type_id":"40003","owner":"41","path":["1730444907710"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2023-03-18"},"publish_date":"2023-03-18","publish_status":"0","recid":"2007050","relation_version_is_last":true,"title":["Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata"],"weko_creator_id":"41","weko_shared_id":-1},"updated":"2025-02-21T09:02:17.593699+00:00"}