On two-way communication in cellular automata with a fixed number of cells

DOI10.1016/j.tcs.2004.04.014zbMath1078.68101OpenAlexW2085181686MaRDI QIDQ1763720

Andreas Malcher

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.014

zbMATH Keywords

Cellular automataRegular languagesDescriptional complexity

Mathematics Subject Classification ID

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

Related Items

IN MEMORIAM CHANDRA KINTALA ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS

Cites Work

• Cellular automata: From a theoretical parallel computational model to its application to complex systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item