Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems

DOI10.1016/0166-218X(91)90094-DzbMath0743.68085MaRDI QIDQ1179180

Karel II Culik, Sheng Yu

Publication date: 26 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

sofic systemsbiinfinite wordsadherences of regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Sofic-Dyck shifts ⋮ Affine automata and related techniques for generation of complex images ⋮ Rational and affine expressions for image description ⋮ Computation theoretic aspects of cellular automata ⋮ Formal languages and global cellular automaton behavior

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation theory of cellular automata
• The complementation problem for Büchi automata with applications to temporal logic
• Adherences of languages
• Theories of automata on \(\omega\)-tapes: a simplified approach
• The monadic second order theory of all countable ordinals
• Finitely generated sofic systems
• On the complementation of Büchi automata
• Subshifts of finite type and sofic systems
• On the Limit Sets of Cellular Automata
• A Sofic System with Infinitely Many Minimal Covers
• Ensembles Reconnaissables de Mots Biinfinis
• Equivalence problems for mappings on infinite strings
• Twenty Problems in the Theory of Cellular Automata
• The undecidability of the domino problem
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems