A classification of \(\omega\)-regular languages
For a given \(\omega\)-regular language A we establish an invariant property of the structure of finite automata which accept A.
scientific article; zbMATH DE number 3902069