Weak Muller acceptance conditions for tree automata

DOI10.1016/j.tcs.2004.10.027zbMath1070.68072OpenAlexW2156579338MaRDI QIDQ1770388

Margherita Napoli, Aniello Murano, Salvatore La Torre

Publication date: 6 April 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.027

zbMATH Keywords

Formal languagesTree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(X\)-automata on \(\omega\)-words
• Reasoning about infinite computations
• Finite automata on timed \(\omega\)-trees
• Automata, logics, and infinite games. A guide to current research
• Weak Second‐Order Arithmetic and Finite Automata
• “Sometimes” and “not never” revisited
• Tools and Algorithms for the Construction and Analysis of Systems
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: Weak Muller acceptance conditions for tree automata