Formal languages and global cellular automaton behavior

DOI10.1016/0167-2789(90)90197-WzbMath0729.68053OpenAlexW1963846625MaRDI QIDQ807036

L. P. Hurd, Sheng Yu, Karel II Culik

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

zbMATH Keywords

dynamical systemscontext-free languagesrecursively enumerable languagescontext-sensitive languagesRegular languagesone-dimensional cellular automatacomputational systems acting on stringsfamilies of subshifts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (4)

Rice's theorem for the limit sets of cellular automata ⋮ Theory of cellular automata: a survey ⋮ Complexity analysis of time series generated by elementary cellular automata ⋮ Computation theoretic aspects of cellular automata

Cites Work

• Computation theoretic aspects of cellular automata
• Computation theory of cellular automata
• Adherences of languages
• Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
• Rice's theorem for the limit sets of cellular automata
• Subshifts of finite type and sofic systems
• On the Limit Sets of Cellular Automata
• Endomorphisms and automorphisms of the shift dynamical system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal languages and global cellular automaton behavior