Infinitary tree languages recognized by \(\omega\)-automata
Regular nondeterministic program schemata and the closely related regular tree languages in Nivat's sense are characterized by top-down infinite tree automata. Deterministic \(\omega\)-languages form a proper subclass of the recognizable infinitary tree languages and this gap cannot be bridged by taking the Boolean closure.
Regular nondeterministic program schemata
scientific article; zbMATH DE number 3858447
scientific article