Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
type: Item
instance of: scholarly article
title: Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
zbMATH Open document ID: 1216.68176
author: Kenichi Morita
published in: Theoretical Computer Science
publication date: 2011-07-18T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5925520
zbMATH Keywords: reversible computing
zbMATH Keywords: reversible cellular automaton
zbMATH Keywords: universal cellular automaton
zbMATH Keywords: reversible Turing machine
zbMATH Keywords: cyclic tag system
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.02.022
OpenAlex ID: W2067549872
cites work: Q5615059
cites work: Q3944542
cites work: Q5321501
cites work: Four states are enough!
cites work: Computation and construction universality of reversible cellular automata
cites work: Q3677179
cites work: A computation-universal two-dimensional 8-state triangular reversible cellular automaton
cites work: Reversible computing and cellular automata -- a survey
cites work: HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
cites work: Q5446408
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Tesselations with local transformations
cites work: Reversibility and surjectivity problems of cellular automata
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Logical Reversibility of Computation
cites work: A Universal Reversible Turing Machine
cites work: Computation-universality of one-dimensional one-way reversible cellular automata
DOI: 10.1016/J.TCS.2011.02.022
description: scientific article; zbMATH DE number 5925520