{"created":"2025-02-21T04:40:20.275493+00:00","id":2008960,"links":{},"metadata":{"_buckets":{"deposit":"754d8c0c-5094-4ce2-a8eb-446bbd250ef2"},"_deposit":{"created_by":41,"id":"2008960","owners":[41],"pid":{"revision_id":0,"type":"depid","value":"2008960"},"status":"published"},"_oai":{"id":"oai:hiroshima.repo.nii.ac.jp:02008960","sets":["1730444907710"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and Its Related Problem","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"}]}]},"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) 1990 IEICE"}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"reversible computing","subitem_subject_scheme":"Other"},{"subitem_subject":"reversible sequential machine","subitem_subject_scheme":"Other"},{"subitem_subject":"Fredkin gate","subitem_subject_scheme":"Other"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"A reversible finite automaton (RFA) is a backward deterministic automaton, i.e., it can uniquely retrace its move sequence if the inverse sequence of its outputs is given. In this paper, we show a simple method to construct an RFA from Fredkin gates, which are reversible and bit-conserving logic gates, and unit wires (unit delays). The resulting circuit obtained by this method is \"garbage-less\" in the sense that it has no inputs to which constants must be supplied nor outputs from which garbage signals are put out. We also show that a one-dimensional reversible partitioned cellular automaton, which are known to be computation universal, can be constructed from Fredkin gates and unit wires as a closed (thus garbage-less) infinite circuit.","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":"0913-574X","subitem_source_identifier_type":"ISSN"},{"subitem_source_identifier":"AA10684666","subitem_source_identifier_type":"NCID"}]},"item_1617187024783":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"978"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1990-06-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicPageEnd":"984","bibliographicPageStart":"978","bibliographicVolumeNumber":"E73","bibliographic_titles":[{"bibliographic_title":"The Transactions of the IEICE"},{"bibliographic_title":"The Transactions of the IEICE"}]}]},"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=e73-e_6_978&category=E&lang=E&year=1990&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_E73-6_978.pdf","filesize":[{"value":"403.1 KB"}],"mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://hiroshima.repo.nii.ac.jp/record/2008960/files/TransIEICE_E73-6_978.pdf"},"version_id":"294c0c4d-8f04-4176-b510-aa13196109f3"}]},"item_1732771732025":{"attribute_name":"旧ID","attribute_value":"48450"},"item_title":"A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and Its Related Problem","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":"2008960","relation_version_is_last":true,"title":["A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and Its Related Problem"],"weko_creator_id":"41","weko_shared_id":-1},"updated":"2025-02-22T04:40:01.711467+00:00"}