Infinitary tree languages recognized by \(\omega\)-automata

DOI10.1016/0020-0190(84)90068-1zbMath0539.68072OpenAlexW1987994907MaRDI QIDQ794179

Ahmed Saoudi

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

zbMATH Keywords

regular tree languagesBüchi's automatadeterministic omega-languagesRabin's special automatarecognizable infinitary tree languagesRegular nondeterministic program schemataregular recursive program schematatop-down infinite tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Variétés d'automates descendants d'arbres infinis ⋮ Generalized automata on infinite trees and Muller-McNaughton's theorem ⋮ Automata on infinite objects and their applications to logic and programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A representation of trees by languages. II
• Adherences of languages
• A note on infinite trees
• Formal computations of non deterministic recursive program schemes
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Infinitary tree languages recognized by \(\omega\)-automata