Tesselations with local transformations
From MaRDI portal
Publication:2555840
Cites work
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- scientific article; zbMATH DE number 3370262 (Why is no real title available?)
- scientific article; zbMATH DE number 3386919 (Why is no real title available?)
- scientific article; zbMATH DE number 3107586 (Why is no real title available?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- The Garden-of-Eden Theorem for Finite Configurations
Cited in
(91)- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- Open maps for tessellation automata
- Linear cellular automata over \(Z_ m\)
- Dynamical characteristics of linear cellular automata
- Intractable problems in reversible cellular automata
- An interconnection of local maps inducing onto global maps
- Pattern decomposition for tessellation automata
- Strong surjectivity is equivalent to C-injectivity
- The structure of reversible one-dimensional cellular automata
- Reproduction in tessellation structures
- On reversibility in cellular automata
- Computation and construction universality of reversible cellular automata
- Certain relations between properties of maps of tessellation automata
- A note on pattern reproduction in tessellation structures
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Injectivity and surjectivity of parallel maps for cellular automata
- Decidability for some problems of linear cellular automata over finite commutative rings
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Reversibility and surjectivity problems of cellular automata
- Invertible shift-invariant transformations on binary arrays
- Group structured linear cellular automata over \(Z_ m\)
- Computability with low-dimensional dynamical systems
- Inversion of 2D cellular automata: Some complexity results
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- The surjectivity problem for 2D cellular automata
- Additive cellular automata and global injectivity
- Remarks on permutive cellular automata.
- A word-counting technique for the solution of stochastic equations
- Graph-theoretical characterization of invertible cellular automata
- Reversible space-time simulation of cellular automata
- Theory of cellular automata: a survey
- Randomness on full shift spaces
- Cellular automata and strongly irreducible shifts of finite type.
- Semi-strongly irreducible shifts
- Efficient exhaustive listings of reversible one dimensional cellular automata
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- Structure of the invertible CA transformations group
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- Topological dynamics of nondeterministic cellular automata
- A tight linear bound on the synchronization delay of bijective automata
- Hybrid one-dimensional reversible cellular automata are regular
- Continuity of information transport in surjective cellular automata
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Ternary reversible number-conserving cellular automata are trivial
- Computation in reversible cellular automata
- Continuous Relations and Richardson’s Theorem
- Some properties of topological pressure on cellular automata
- Confusion in the Garden of Eden
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA
- Induced Subshifts and Cellular Automata
- PERIODIC CONFIGURATIONS OF SUBSHIFTS ON GROUPS
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- Some applications of propositional logic to cellular automata
- scientific article; zbMATH DE number 3898250 (Why is no real title available?)
- Cellular automata between sofic tree shifts
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- scientific article; zbMATH DE number 1154159 (Why is no real title available?)
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- Representation of reversible cellular automata with block permutations
- Reversibility of non-saturated linear cellular automata on finite triangular grids
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Growing patterns in 1D cellular automata
- Nondeterministic cellular automata
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- On the image set and reversibility of shift morphisms over discrete alphabets
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
- Uniform continuity of relations and nondeterministic cellular automata
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Linear cellular automata on Cayley graphs
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Inversion of Mutually Orthogonal Cellular Automata
- Four states are enough!
- The algebraic entropy of one-dimensional finitary linear cellular automata
- The complexity of iterated reversible computation
- Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence
- Firing squad synchronization problem in reversible cellular automata
- A Random NP-complete problem for inversion of 2D cellular automata
- Complex wave functions, CPT and quantum field theory for classical generalized Ising models
- Not just the Garden of Eden: additional takes on cellular automata surjectivity
- Indecomposable maps in tesselation structures of arbitrary dimension
- Computation theoretic aspects of cellular automata
- Cellular automata and discrete neural networks
- Reversibility of 2D cellular automata is undecidable
- Invertible cellular automata: A review
- The topological pressure of linear cellular automata
- Reversible computing and cellular automata -- a survey
This page was built for publication: Tesselations with local transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555840)
