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.











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)