Efficient unidimensional universal cellular automaton

DOI10.1007/3-540-55808-X_36zbMath1493.68235OpenAlexW1483948757MaRDI QIDQ5096850

Bruno Martin

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_36

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

Cellular automata universality revisited

Cites Work

• On real-time cellular automata and trellis automata
• Real-time language recognition by one-dimensional cellular automata
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Simple Computation-Universal Cellular Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient unidimensional universal cellular automaton