On the reversibility and the closed image property of linear cellular automata

DOI10.1016/J.TCS.2010.09.020zbMath1206.68201arXiv0910.0863OpenAlexW2045378373MaRDI QIDQ620938

Michel Coornaert, Tullio G. Ceccherini Silberstein

Publication date: 2 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.0863

zbMATH Keywords

cellular automatonlinear cellular automatonreversible cellular automatonclosed image propertyMittag-Leffler Lemma

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

A Garden of Eden theorem for linear subshifts ⋮ On the image set and reversibility of shift morphisms over discrete alphabets ⋮ Surjunctivity and Reversibility of Cellular Automata over Concrete Categories ⋮ On linear shifts of finite type and their endomorphisms ⋮ On surjunctive monoids

Cites Work

• Unnamed Item
• On Burnside's problem on periodic groups
• Endomorphisms of symbolic algebraic varieties
• Topological invariants of dynamical systems and spaces of holomorphic maps. I.
• Injective linear cellular automata and sofic groups
• The Garden of Eden theorem for linear cellular automata
• Induction and restriction of cellular automata
• Endomorphisms and automorphisms of the shift dynamical system

This page was built for publication: On the reversibility and the closed image property of linear cellular automata