Language Recognition by Reversible Partitioned Cellular Automata

DOI10.1007/978-3-319-18812-6_9zbMath1432.68290OpenAlexW608074773MaRDI QIDQ5501617

Kenichi Morita

Publication date: 4 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: http://ir.lib.hiroshima-u.ac.jp/00036074

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites Work

• Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
• Fast reversible language recognition using cellular automata
• Reversible space equals deterministic space
• Real-time language recognition by one-dimensional cellular automata
• Two-Way Reversible Multi-Head Finite Automata
• A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads

This page was built for publication: Language Recognition by Reversible Partitioned Cellular Automata