On the weak index problem for game automata

DOI10.1007/978-3-662-47709-0_8zbMATH Open1465.68143OpenAlexW984805233MaRDI QIDQ2947463FDOQ2947463

Authors: Alessandro Facchini, Filip Murlak, 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

Recommendations

• Index problems for game automata
• Rabin-Mostowski index problem: a step beyond deterministic automata
• Weak index versus Borel rank
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
• Hierarchies of weak automata and weak monadic formulas

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The Borel hierarchy is infinite in the class of regular sets of trees
• A gap property of deterministic tree languages.
• On ω-regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchies of weak automata and weak monadic formulas
• On the Topological Complexity of Weakly Recognizable Tree Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rabin-Mostowski index problem: a step beyond deterministic automata
• Computer Science Logic
• The modal mu-calculus alternation hierarchy is strict
• Definable operations on weakly recognizable sets of trees
• Weak index versus Borel rank

Cited In (4)

• Rabin-Mostowski index problem: a step beyond deterministic automata
• Index problems for game automata
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
• Weak index versus Borel rank

This page was built for publication: On the weak index problem for game automata

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