VOLUME 26 2021 NUMBERS 1–2
Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton
Kenichi Morita
Pages 125–144



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2021-125,
  author  = {Kenichi Morita},
  title   = {Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {26},
  number  = {1--2},
  pages   = {125--144},
  year    = {2021},
  url     = {https://doi.org/10.25596/jalc-2021-125},
  doi     = {10.25596/jalc-2021-125}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: reversible computing, elementary triangular partitioned cellular automaton, reversible logic element with memory, reversible Turing machine, universality
DOI: 10.25596/jalc-2021-125