Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q418765 |
Changed an Item |
||
Property / author | |||
Property / author: Sheng Yu / rank | |||
Normal rank |
Revision as of 19:05, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems |
scientific article |
Statements
Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (English)
0 references
26 June 1992
0 references
Several mechanisms for defining sets of biinfinite words (\(\omega\omega\)- languages) namely \(\omega\omega\)-finite automata, adherences of regular languages and sofic systems are investigated and compared. It is shown that \(C\subseteq S^ Z\) is a sofic system iff \(C\) is the adherence of a regular language, iff \(C\) is a topologically closed \(\omega\omega\)- regular set. This paper also gives another complete proof of the closure of the \(\omega\omega\)-regular sets under \(\omega\omega\)-rational relations and under Boolean operations. Finally, Hurd's conjecture on bi- extensible subsets of languages is disproved.
0 references
biinfinite words
0 references
adherences of regular languages
0 references
sofic systems
0 references