Formal languages and global cellular automaton behavior
DOI10.1016/0167-2789(90)90197-WzbMATH Open0729.68053OpenAlexW1963846625MaRDI QIDQ807036FDOQ807036
Authors: L. P. Hurd, Karel II Culik, Sheng Yu 
Publication date: 1990
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-2789(90)90197-w
Recommendations
dynamical systemscontext-free languagescontext-sensitive languagesRegular languagesrecursively enumerable languagescomputational systems acting on stringsfamilies of subshiftsone-dimensional cellular automata
Cites Work
- Subshifts of finite type and sofic systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endomorphisms and automorphisms of the shift dynamical system
- On the Limit Sets of Cellular Automata
- Title not available (Why is that?)
- Computation theory of cellular automata
- Computation theoretic aspects of cellular automata
- Title not available (Why is that?)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Rice's theorem for the limit sets of cellular automata
- Title not available (Why is that?)
- Adherences of languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Title not available (Why is that?)
- Embedding Bratteli–Vershik systems in cellular automata
- Machines, Computations, and Universality
- Complexity analysis of time series generated by elementary cellular automata
- A Language for Particle Interactions in Rule 54 and Other Cellular Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of cellular automata: a survey
- REDUCED POWER AUTOMATA AND SOFIC SYSTEMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On formal languages in one-dimensional dynamical systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation theoretic aspects of cellular automata
- Rice's theorem for the limit sets of cellular automata
- Two-dimensional languages and cellular automata
- Languages, equicontinuity and attractors in cellular automata
- A comparison of finite and cellular automata
This page was built for publication: Formal languages and global cellular automaton behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807036)
