Cellular Automata with Sparse Communication

DOI10.1007/978-3-642-02979-0_7MaRDI QIDQ3637339zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher

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)

Recommendations

• Cellular automata with sparse communication
• Bounded languages meet cellular automata with sparse communication
• On one-way one-bit O (one)-message cellular automata
• Measuring communication in automata systems (invited paper)
• Cellular automata with limited inter-cell bandwidth

Cites work

• Cellular automata -- a computational point of view
• Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
• Fast reversible language recognition using cellular automata
• scientific article; zbMATH DE number 3718546 (Why is no real title available?)
• scientific article; zbMATH DE number 2068878 (Why is no real title available?)
• scientific article; zbMATH DE number 1512708 (Why is no real title available?)
• scientific article; zbMATH DE number 1886333 (Why is no real title available?)
• scientific article; zbMATH DE number 2113950 (Why is no real title available?)
• Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Some remarks about the efficiency of polyautomata

Cited in

(10)

• Cellular automata with sparse communication
• Progress, gaps and obstacles in the classification of cellular automata
• On one-way one-bit O (one)-message cellular automata
• Measuring communication in automata systems (invited paper)
• scientific article; zbMATH DE number 6502824 (Why is no real title available?)
• scientific article; zbMATH DE number 5190413 (Why is no real title available?)
• Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
• Bounded languages meet cellular automata with sparse communication
• Determination of one-way bandwidth of cellular automata using binary decision diagrams
• Cellular automata with limited inter-cell bandwidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637339)