scientific article; zbMATH DE number 3205673
From MaRDI portal
Publication:5333602
Cited in
(only showing first 100 items - show all)- Strong surjectivity is equivalent to C-injectivity
- A tight linear bound on the synchronization delay of bijective automata
- The behavioral properties of homogeneous structures
- Garden of Eden configurations for 2-D cellular automata with rule 2460 N
- On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
- A Random NP-complete problem for inversion of 2D cellular automata
- A completeness problem for pattern generation in tessellation automata
- Pattern reproduction in tessellation automata of arbitrary dimension
- Tessellation structures for reproduction of arbitrary patterns
- Certain relations between properties of maps of tessellation automata
- Injectivity and surjectivity of parallel maps for cellular automata
- scientific article; zbMATH DE number 3487382 (Why is no real title available?)
- Computation and construction universality of reversible cellular automata
- Algebraic properties of cellular automata
- On images of subshifts under embeddings of symbolic varieties
- The Most General Conservation Law for a Cellular Automaton
- Reversibility of 2D cellular automata is undecidable
- Inversion of 2D cellular automata: Some complexity results
- The surjectivity problem for 2D cellular automata
- Bulking II: Classifications of cellular automata
- Confusion in the Garden of Eden
- Randomness on full shift spaces
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Dynamical behavior of additive cellular automata over finite abelian groups
- Invariant sets and nilpotency of endomorphisms of algebraic sofic shifts
- On forced periodicity of perfect colorings
- Statistical mechanics of surjective cellular automata
- Not just the Garden of Eden: additional takes on cellular automata surjectivity
- Some applications of propositional logic to cellular automata
- CORRESPONDENCE BETWEEN LOCAL MAPS AND GLOBAL MAPS IN CELLULAR AUTOMATA
- Two graphs: resolving the periodic reversibility of one-dimensional finite cellular automata
- A fuzzy delay approach for HIV dynamics using a cellular automaton
- Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
- Some results about the chaotic behavior of cellular automata
- The average diameter of general tree structures
- Hybrid one-dimensional reversible cellular automata are regular
- The Garden of Eden theorem over generalized cellular automata
- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Semi-strongly irreducible shifts
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions
- Theory of cellular automata: a survey
- Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
- Snakes and cellular automata: reductions and inseparability results
- Reversibility and surjectivity problems of cellular automata
- Groups, graphs, languages, automata, games and second-order monadic logic
- The constructibility of a configuration in a cellular automaton
- The calculation of average distance in mesh structures.
- Equivalence of relative Gibbs and relative equilibrium measures for actions of countable amenable groups
- Amenability of groups and G-sets
- Growing patterns in 1D cellular automata
- Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
- Reversible space-time simulation of cellular automata
- The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata
- The Garden of Eden theorem for cellular automata on group sets
- A garden of Eden theorem for Anosov diffeomorphisms on tori
- Injectivity of cellular automata
- Stable finiteness of twisted group rings and noisy linear cellular automata
- The Garden-of-Eden Theorem for Finite Configurations
- On invertible and stably reversible non-uniform cellular automata
- From linear to additive cellular automata
- Amenability of groups is characterized by Myhill's theorem
- Linear cellular automata on Cayley graphs
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Unconventional Computation
- Three research directions in non-uniform cellular automata
- Parallel dynamical systems over graphs and related topics: a survey
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- On Gottschalk's surjunctivity conjecture for non-uniform cellular automata
- INJECTIVITY OF CELLULAR AUTOMATA (II)
- Gardens of Eden and amenability on cellular automata
- Traffic flow: A statistical physics point of view
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Reviews
- Nilpotent endomorphisms of expansive group actions
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- About the Garden of Eden theorems for cellular automata in the hyperbolic plane
- On dual surjunctivity and applications
- Forming of multi-colour images by cellular automata
- Open maps for tessellation automata
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- Surprising areas in the quest for small universal devices
- Number conserving cellular automata. II: Dynamics.
- Computation theoretic aspects of cellular automata
- Bounds on Non-surjective Cellular Automata
- Linear cellular automata over \(Z_ m\)
- Reproduction in tessellation structures
- Linear algebra based bounds for one-dimensional cellular automata
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Cellular automata and strongly irreducible shifts of finite type.
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- The Myhill property for cellular automata on amenable semigroups
- Garden of Eden and weakly periodic points for certain expansive actions of groups
- A generalized neighborhood for cellular automata
- Non-uniform Cellular Automata
- Garden of Eden and specification
- The reversibility problem for a family of two-dimensional cellular automata
- The average diameter and its estimation in nonlinear structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5333602)