View in EDS

Fredkin gates in simple reversible cellular automata.

Saved in:
Bibliographic Details
Title: Fredkin gates in simple reversible cellular automata.
Authors: Morita, Kenichi1 (AUTHOR) km@hiroshima-u.ac.jp
Source: International Journal of Parallel, Emergent & Distributed Systems. May2022, Vol. 37 Issue 3, p249-272. 24p.
Subjects: Cellular automata, Cell compartmentation, Turing machines, Mathematical logic, Logic circuits, Reversible computing
Abstract: In this paper, we give a survey on the problem of how a Fredkin gate, a universal reversible logic gate, is realised in various reversible cellular automata (RCAs). Models of RCAs considered here are two kinds of square partitioned cellular automata (SPCAs), and four kinds of elementary triangular partitioned cellular automata (ETPCAs). These six RCAs are very simple, in particular, ETPCAs are extremely simple, yet they are computationally universal in the sense any reversible Turing machine, which is composed of Fredkin gates, can be embedded in them. There are three key points for implementing a Fredkin gate in an RCA: (1) realising a signal, (2) routeing a signal, and (3) interacting two signals. We shall see that depending on the properties of the RCAs, different techniques are used to realise the above three functions. Based on these techniques, complete configurations of Fredkin gates in the six RCAs are given. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 156292110
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Fredkin gates in simple reversible cellular automata.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Morita%2C+Kenichi%22">Morita, Kenichi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> km@hiroshima-u.ac.jp</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel%2C+Emergent+%26+Distributed+Systems%22">International Journal of Parallel, Emergent & Distributed Systems</searchLink>. May2022, Vol. 37 Issue 3, p249-272. 24p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Cellular+automata%22">Cellular automata</searchLink><br /><searchLink fieldCode="DE" term="%22Cell+compartmentation%22">Cell compartmentation</searchLink><br /><searchLink fieldCode="DE" term="%22Turing+machines%22">Turing machines</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+logic%22">Mathematical logic</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+circuits%22">Logic circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Reversible+computing%22">Reversible computing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this paper, we give a survey on the problem of how a Fredkin gate, a universal reversible logic gate, is realised in various reversible cellular automata (RCAs). Models of RCAs considered here are two kinds of square partitioned cellular automata (SPCAs), and four kinds of elementary triangular partitioned cellular automata (ETPCAs). These six RCAs are very simple, in particular, ETPCAs are extremely simple, yet they are computationally universal in the sense any reversible Turing machine, which is composed of Fredkin gates, can be embedded in them. There are three key points for implementing a Fredkin gate in an RCA: (1) realising a signal, (2) routeing a signal, and (3) interacting two signals. We shall see that depending on the properties of the RCAs, different techniques are used to realise the above three functions. Based on these techniques, complete configurations of Fredkin gates in the six RCAs are given. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=156292110
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/17445760.2022.2052871
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 24
        StartPage: 249
    Subjects:
      – SubjectFull: Cellular automata
        Type: general
      – SubjectFull: Cell compartmentation
        Type: general
      – SubjectFull: Turing machines
        Type: general
      – SubjectFull: Mathematical logic
        Type: general
      – SubjectFull: Logic circuits
        Type: general
      – SubjectFull: Reversible computing
        Type: general
    Titles:
      – TitleFull: Fredkin gates in simple reversible cellular automata.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Morita, Kenichi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2022
              Type: published
              Y: 2022
          Identifiers:
            – Type: issn-print
              Value: 17445760
          Numbering:
            – Type: volume
              Value: 37
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: International Journal of Parallel, Emergent & Distributed Systems
              Type: main
ResultId 1