FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
Victor Selivanov · International Journal of Foundations of Computer Science · 2008
We develop a theory of regular aperiodic ω-languages in parallel with the theory around the Wagner hierarchy. In particular, we characterize the Wadge degrees of regular aperiodic ω-languages, find an effective version of the Wadge reducibility adequate for this class of languages and prove "aperiodic analogs" of the Büchi-Landweber determinacy theorem and of the Landweber's characterization of regular open and regular Gδ sets.