Cellular Automata with Sparse Communication

DOI10.1007/978-3-642-02979-0_7zbMath1248.68343OpenAlexW2170566806MaRDI QIDQ3637339

Andreas Malcher, Martin Kutrib

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: http://geb.uni-giessen.de/geb/volltexte/2012/9081/

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Progress, gaps and obstacles in the classification of cellular automata ⋮ On One-way One-bit O (One)-message Cellular Automata

Cites Work

• Some remarks about the efficiency of polyautomata
• Fast reversible language recognition using cellular automata
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
• Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cellular Automata with Sparse Communication