Reversibility of Elementary Cellular Automata under Fully Asynchronous Update

DOI10.1007/978-3-319-06089-7_4zbMath1405.68207OpenAlexW153039345MaRDI QIDQ5410634

Nazim Fatès, Sukanta Das, Biswanath Sethi

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00906987/file/hal-revACA.pdf

zbMATH Keywords

classificationrecurrencereversibilityasynchronous cellular automataMarkov chain modelling

Mathematics Subject Classification ID

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

Related Items (7)

A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View ⋮ Virtual cyclic cellular automata, finite group actions and recursive properties ⋮ CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Unnamed Item ⋮ A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule

This page was built for publication: Reversibility of Elementary Cellular Automata under Fully Asynchronous Update