scientific article; zbMATH DE number 3917744
From MaRDI portal
Publication:3692897
[For the entire collection see Zbl 0568.00020.] We prove that the family \(Rec(^{\omega}A^{\omega})\) of regular sets of bi-infinite words is equal to the family of sets recognized by a deterministic Muller automaton. That extends a theorem of Mc Naughton for one sided infinite words to the case of bi-infinite words.
Recommendations
Cited in
(6)- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- scientific article; zbMATH DE number 3947646 (Why is no real title available?)
- Ensembles Reconnaissables de Mots Biinfinis
- scientific article; zbMATH DE number 3992940 (Why is no real title available?)
- scientific article; zbMATH DE number 222345 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692897)