Variétés d'automates descendants d'arbres infinis

DOI10.1016/0304-3975(86)90183-0zbMath0597.68061OpenAlexW2018168051MaRDI QIDQ1079382

Ahmed Saoudi

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90183-0

zbMATH Keywords

automataBüchi automataMuller automataautomata recognizing infinite tree languagesvarieties of

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Language-theoretical representations of \(\omega\)-languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitary tree languages recognized by \(\omega\)-automata
• Fundamental properties of infinite trees
• A representation of trees by languages. II
• Adherences of languages
• A note on infinite trees
• Pushdown tree automata
• Formal computations of non deterministic recursive program schemes
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Variétés d'automates descendants d'arbres infinis