Universal Reversible Turing Machines with a Small Number of Tape Symbols

DOI10.3233/FI-2015-1195zbMath1335.68091OpenAlexW1491991654MaRDI QIDQ2805443

Kenichi Morita

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1195

zbMATH Keywords

universal Turing machinereversible computingcyclic tag system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Small Universal Reversible Counter Machines

This page was built for publication: Universal Reversible Turing Machines with a Small Number of Tape Symbols