Fast one-way cellular automata.

DOI10.1016/S0304-3975(02)00406-1zbMath1051.68106OpenAlexW1971862957MaRDI QIDQ1401242

Martin Kutrib, Andreas G. Klein

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00406-1

zbMATH Keywords

Cellular automataClosure propertiesComputational complexityModels of computationTime hierarchies

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Cellular Automata: Descriptional Complexity and Decidability ⋮ Shrinking one-way cellular automata ⋮ Complexity of One-Way Cellular Automata

Cites Work

• Unnamed Item
• On real time one-way cellular array
• On real-time cellular automata and trellis automata
• On time computability of functions in one-way cellular automata
• Signals in one-dimensional cellular automata
• Language not recognizable in real time by one-way cellular automata
• Real-time language recognition by one-dimensional cellular automata
• One-way bounded cellular automata
• Generation of Primes by a One-Dimensional Real-Time Iterative Array

This page was built for publication: Fast one-way cellular automata.