On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View

DOI10.1007/978-3-319-73216-9_15zbMath1434.68313OpenAlexW2777036957WikidataQ60691809 ScholiaQ60691809MaRDI QIDQ5112178

Nazim Fatès, Sukanta Das, Biswanath Sethi

Publication date: 28 May 2020

Published in: Reversibility and Universality (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01571847/file/FatesDasSethi-recurrentECA-hal-v1-2017.pdf

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Reversible computing and cellular automata -- a survey
• Computation and construction universality of reversible cellular automata
• Tesselations with local transformations
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• A full computation-relevant topological dynamics classification of elementary cellular automata
• Reversibility of Elementary Cellular Automata under Fully Asynchronous Update