ON ASYNCHRONOUS CELLULAR AUTOMATA

DOI10.1142/S0219525905000555zbMATH Open1092.37007OpenAlexW2023749199WikidataQ56266980 ScholiaQ56266980MaRDI QIDQ3373085FDOQ3373085

A. Å. Hansson, Christian M. Reidys, Henning S. Mortveit

Publication date: 13 March 2006

Published in: Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219525905000555

Recommendations

• Computational aspects of asynchronous cellular automata
• Asynchronous cellular automata and dynamical properties
• Fundamentals of Computation Theory
• Asynchronous mappings and asynchronous cellular automata
• Computation by asynchronously updating cellular automata
• Asynchronous automata versus asynchronous cellular automata
• Some Formal Properties of Asynchronous Cellular Automata
• Synchronization of asynchronous concurrent processes using cellular automata
• Delay-insensitive computation in asynchronous cellular automata

zbMATH Keywords

periodic pointinvertibilityphase spaceasynchronous cellular automatonsequential dynamical systemupdate schedule invariance

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cites Work

• Discrete, sequential dynamical systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• Combinatorial problems of commutation and rearrangements
• On acyclic orientations and sequential dynamical systems
• Title not available (Why is that?)

Cited In (14)

• Dynamics groups of asynchronous cellular automata
• Combinatorics on update digraphs in Boolean networks
• Asynchronous cellular automata for pomsets
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
• Computation by asynchronously updating cellular automata
• On the complexity of asynchronous freezing cellular automata
• A comprehensive taxonomy of cellular automata
• Fundamentals of Computation Theory
• On the Synchronisation Problem over Cellular Automata
• Order Independence in Asynchronous Cellular Automata
• Agent-Based Modeling, Mathematical Formalism for
• Coxeter groups and asynchronous cellular automata
• The number of fixed points of AND-OR networks with chain topology

This page was built for publication: ON ASYNCHRONOUS CELLULAR AUTOMATA

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