On automata on infinite trees

DOI10.1016/0304-3975(92)90331-9zbMath0802.68085OpenAlexW2089201581WikidataQ57518704 ScholiaQ57518704MaRDI QIDQ1186604

Paola Bonizzoni, Giancarlo Mauri

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90331-9

zbMATH Keywords

Büchi automataacceptanceBoolean closureBoolean operatorsMuller tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The poset of infinitary traces

Cites Work

• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• Automata-theoretic techniques for modal logics of programs
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On automata on infinite trees