Computational aspects of asynchronous cellular automata

DOI10.1007/978-3-642-22321-1_41MaRDI QIDQ5199992zbMATH OpenOpenAlexFDO

Authors Jérôme Chandesris, Alberto Dennunzio, Luca Manzoni, Enrico Formenti

Publication date 29 July 2011

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22321-1_41

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Computational complexity of finite asynchronous cellular automata
• Computing issues of asynchronous CA
• A guided tour of asynchronous cellular automata
• Tutorial on cellular automata
• Delay-insensitive computation in asynchronous cellular automata

Cited in

(14)

• Asynchronous cellular automata for pomsets
• Computation by asynchronously updating cellular automata
• On the complexity of asynchronous freezing cellular automata
• An introduction to tile-based self-assembly and a survey of recent results
• m-asynchronous cellular automata: from fairness to quasi-fairness
• Computation of functions on n bits by asynchronous clocking of cellular automata
• Commutative cellular automata
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Cellular automata and parallel array systems
• Fractal arrangement for 2D cellular automata and its implementation in outer-totalistic rules
• On shift-invariant maximal filters and hormonal cellular automata
• Computational complexity of finite asynchronous cellular automata
• Fundamentals of Computation Theory
• Synchronism versus asynchronism in monotonic Boolean automata networks

This page was built for publication: Computational aspects of asynchronous cellular automata

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