Definable operations on weakly recognizable sets of trees

DOI10.4230/LIPICS.FSTTCS.2011.363MaRDI QIDQ2911638zbMATH OpenOpenAlexFDO

Authors Jacques Duparc, Alessandro Facchini, Filip Murlak

Publication date 31 August 2012

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.363

zbMATH Keywords

alternating automataindex hierarchywadge hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the Topological Complexity of Weakly Recognizable Tree Languages
• Weak index versus Borel rank
• Deciding the weak definability of Büchi definable tree languages
• scientific article; zbMATH DE number 3999901
• Hierarchies of weak automata and weak monadic formulas

Cited in

(8)

• On the weak index problem for game automata
• Deciding the weak definability of Büchi definable tree languages
• scientific article; zbMATH DE number 6000848 (Why is no real title available?)
• Frame Definability for Classes of Trees in the μ-calculus
• Weak index versus Borel rank
• scientific article; zbMATH DE number 3894467 (Why is no real title available?)
• Index problems for game automata
• On the Topological Complexity of Weakly Recognizable Tree Languages

This page was built for publication: Definable operations on weakly recognizable sets of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911638)