Infinitary tree languages recognized by \(\omega\)-automata
From MaRDI portal
Publication:794179
DOI10.1016/0020-0190(84)90068-1zbMath0539.68072MaRDI QIDQ794179
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90068-1
regular tree languages; Büchi's automata; deterministic omega-languages; Rabin's special automata; recognizable infinitary tree languages; Regular nondeterministic program schemata; regular recursive program schemata; top-down infinite tree automata
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Automata on infinite objects and their applications to logic and programming, Variétés d'automates descendants d'arbres infinis, Generalized automata on infinite trees and Muller-McNaughton's theorem
Cites Work