On the Limit Sets of Cellular Automata
From MaRDI portal
DOI10.1137/0218057zbMATH Open0691.68060DBLPjournals/siamcomp/CulikPY89OpenAlexW2023873787WikidataQ58329989 ScholiaQ58329989MaRDI QIDQ3033336FDOQ3033336
Karel II Culik, Jan Pachl, Sheng Yu
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218057
Recommendations
Cited In (70)
- An atlas of limit set dynamics for asynchronous elementary cellular automata
- Title not available (Why is that?)
- Limit behaviour of \(\mu\)-equicontinuous cellular automata
- Predecessor existence problems for finite discrete dynamical systems
- Complexity of generic limit sets of cellular automata
- Limiting behaviour of linear cellular automata
- On linear shifts of finite type and their endomorphisms
- Decidability and undecidability in cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress, gaps and obstacles in the classification of cellular automata
- On the asymptotic behavior of fuzzy cellular automata
- A search algorithm for subshift attractors of cellular automata
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- The surjectivity problem for 2D cellular automata
- Bulking II: Classifications of cellular automata
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Directional dynamics for cellular automata: A sensitivity to initial condition approach
- Sand automata as cellular automata
- On the limit set of some universal cellular automata
- Nilpotency and Limit Sets of Cellular Automata
- The complexity of limit languages of cellular automata: An example
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- The relationships of three elementary cellular automata
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
- Theory of cellular automata: a survey
- Inducing an order on cellular automata by a grouping operation
- Reversibility and surjectivity problems of cellular automata
- Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
- Characterisation of limit measures of higher-dimensional cellular automata
- Growing patterns in 1D cellular automata
- Asymptotic Cellular Complexity
- A new dimension sensitive property for cellular automata
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- Solution of some conjectures about topological properties of linear cellular automata
- On Nilpotency and Asymptotic Nilpotency of Cellular Automata
- Towards a Rice Theorem on Traces of Cellular Automata
- Cellular automata are the continuous self-mappings of configuration spaces
- On the conjugacy problem of cellular automata
- On the sofic limit sets of cellular automata
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- A uniquely ergodic cellular automaton
- Limit set problem of multi-agent systems with finite states: an eigenvalue-based approach
- Arithmetical complexity of the language of generic limit sets of cellular automata
- The mirage of universality in cellular automata
- Topological and measure-theoretic properties of one-dimensional cellular automata
- On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attractors of linear cellular automata
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- Complexity of reachability problems for finite discrete dynamical systems
- The immortality problem for Lag systems
- Title not available (Why is that?)
- Number conserving cellular automata. II: Dynamics.
- Computation theoretic aspects of cellular automata
- Rice's theorem for the limit sets of cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
- Formal languages and global cellular automaton behavior
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- The Nilpotency Problem of One-Dimensional Cellular Automata
- On ergodic linear cellular automata over Zm
- Inferring the Limit Behavior of Some Elementary Cellular Automata
- Cold dynamics in cellular automata: a tutorial
- Parallel pattern generation with one-way communications
- Automaton (Semi)groups: Wang Tilings and Schreier Tries
- On dynamical finiteness properties of algebraic group shifts
- GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012
- A comprehensive taxonomy of cellular automata
This page was built for publication: On the Limit Sets of Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033336)
