On the Weak Index Problem for Game Automata

DOI10.1007/978-3-662-47709-0_8zbMath1465.68143OpenAlexW984805233MaRDI QIDQ2947463

Filip Murlak, Alessandro Facchini, Michał Skrzypczak

Publication date: 24 September 2015

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47709-0_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Index Problems for Game Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of weak automata and weak monadic formulas
• The Borel hierarchy is infinite in the class of regular sets of trees
• A gap property of deterministic tree languages.
• Definable Operations On Weakly Recognizable Sets of Trees
• On ω-regular sets
• Weak index versus Borel rank
• Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
• Computer Science Logic
• On the Topological Complexity of Weakly Recognizable Tree Languages
• The modal mu-calculus alternation hierarchy is strict