Tesselations with local transformations
From MaRDI portal
Publication:2555840
DOI10.1016/S0022-0000(72)80009-6zbMATH Open0246.94037OpenAlexW1985779652WikidataQ55921396 ScholiaQ55921396MaRDI QIDQ2555840FDOQ2555840
Authors: Yanyan Li 
Publication date: 1972
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(72)80009-6
Cites Work
Cited In (89)
- Title not available (Why is that?)
- Cellular automata between sofic tree shifts
- Reversibility of non-saturated linear cellular automata on finite triangular grids
- Computation and construction universality of reversible cellular automata
- PERIODIC CONFIGURATIONS OF SUBSHIFTS ON GROUPS
- Continuous Relations and Richardson’s Theorem
- Reversibility of 2D cellular automata is undecidable
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
- Inversion of 2D cellular automata: Some complexity results
- The surjectivity problem for 2D cellular automata
- Four states are enough!
- Intractable problems in reversible cellular automata
- Computation in reversible cellular automata
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Induced Subshifts and Cellular Automata
- Reversible computing and cellular automata -- a survey
- Firing squad synchronization problem in reversible cellular automata
- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- An interconnection of local maps inducing onto global maps
- Semi-strongly irreducible shifts
- Efficient exhaustive listings of reversible one dimensional cellular automata
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Theory of cellular automata: a survey
- Reversibility and surjectivity problems of cellular automata
- Decidability for some problems of linear cellular automata over finite commutative rings
- Some properties of topological pressure on cellular automata
- Growing patterns in 1D cellular automata
- Group structured linear cellular automata over \(Z_ m\)
- Reversible space-time simulation of cellular automata
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- Invertible cellular automata: A review
- Dynamical characteristics of linear cellular automata
- The topological pressure of linear cellular automata
- Pattern decomposition for tessellation automata
- On reversibility in cellular automata
- Linear cellular automata on Cayley graphs
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- The structure of reversible one-dimensional cellular automata
- Invertible shift-invariant transformations on binary arrays
- 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
- Open maps for tessellation automata
- Computability with low-dimensional dynamical systems
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- Computation theoretic aspects of cellular automata
- Linear cellular automata over \(Z_ m\)
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Reproduction in tessellation structures
- A note on pattern reproduction in tessellation structures
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA
- Indecomposable maps in tesselation structures of arbitrary dimension
- Cellular automata and strongly irreducible shifts of finite type.
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Continuity of information transport in surjective cellular automata
- Nondeterministic cellular automata
- Cellular automata and discrete neural networks
- Topological dynamics of nondeterministic cellular automata
- Representation of reversible cellular automata with block permutations
- A tight linear bound on the synchronization delay of bijective automata
- Strong surjectivity is equivalent to C-injectivity
- A Random NP-complete problem for inversion of 2D cellular automata
- Certain relations between properties of maps of tessellation automata
- Injectivity and surjectivity of parallel maps for cellular automata
- Structure of the invertible CA transformations group
- Uniform continuity of relations and nondeterministic cellular automata
- Title not available (Why is that?)
- The algebraic entropy of one-dimensional finitary linear cellular automata
- The complexity of iterated reversible computation
- Remarks on permutive cellular automata.
- On the image set and reversibility of shift morphisms over discrete alphabets
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- Confusion in the Garden of Eden
- Randomness on full shift spaces
- Some applications of propositional logic to cellular automata
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence
- Hybrid one-dimensional reversible cellular automata are regular
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Inversion of Mutually Orthogonal Cellular Automata
- On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- A word-counting technique for the solution of stochastic equations
- Graph-theoretical characterization of invertible cellular automata
- Additive cellular automata and global injectivity
- Ternary reversible number-conserving cellular automata are trivial
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)
