Nondeterministic cellular automata

DOI10.1016/J.INS.2014.07.007zbMATH Open1355.68184OpenAlexW2003666822MaRDI QIDQ508657FDOQ508657

Authors: Pietro Di Lena, Luciano Margara 

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.007

Recommendations

• Topological dynamics of nondeterministic cellular automata
• Equicontinuity and sensitivity of nondeterministic cellular automata
• scientific article; zbMATH DE number 2113944
• Non-uniform cellular automata: classes, dynamics, and decidability
• Non-deterministic cellular automata and languages

zbMATH Keywords

reversibilitycellular automatanondeterminismsurjectivity

Mathematics Subject Classification ID

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

Cites Work

• An Introduction to Symbolic Dynamics and Coding
• Universality in elementary cellular automata
• Endomorphisms and automorphisms of the shift dynamical system
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Classes of linear automata
• Languages, equicontinuity and attractors in cellular automata
• Directional dynamics for cellular automata: A sensitivity to initial condition approach
• On the directional dynamics of additive cellular automata
• Reversibility and surjectivity problems of cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Decidable Properties of 2D Cellular Automata
• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Title not available (Why is that?)
• Computations on nondeterministic cellular automata
• Attractors in cellular automata
• Tesselations with local transformations
• Title not available (Why is that?)
• Subshift attractors of cellular automata
• Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
• Title not available (Why is that?)
• On the undecidability of the limit behavior of cellular automata
• Reversibility of 2D cellular automata is undecidable
• Invertible cellular automata: A review
• Rice's theorem for the limit sets of cellular automata
• Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
• Computation and construction universality of reversible cellular automata
• On the undecidability of attractor properties for cellular automata
• Continuous Relations and Richardson’s Theorem
• Towards a Rice Theorem on Traces of Cellular Automata
• Computational complexity of dynamical systems: the case of cellular automata

Cited In (4)

• A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
• Title not available (Why is that?)
• Topological dynamics of nondeterministic cellular automata
• Uniform continuity of relations and nondeterministic cellular automata

This page was built for publication: Nondeterministic cellular automata

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