On the weak index problem for game automata
From MaRDI portal
Publication:2947463
Recommendations
Cites work
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 1304332 (Why is no real title available?)
- scientific article; zbMATH DE number 475417 (Why is no real title available?)
- scientific article; zbMATH DE number 1136080 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- A gap property of deterministic tree languages.
- Computer Science Logic
- Definable operations on weakly recognizable sets of trees
- Hierarchies of weak automata and weak monadic formulas
- On the Topological Complexity of Weakly Recognizable Tree Languages
- On ω-regular sets
- Rabin-Mostowski index problem: a step beyond deterministic automata
- The Borel hierarchy is infinite in the class of regular sets of trees
- The modal mu-calculus alternation hierarchy is strict
- Weak index versus Borel rank
Cited in
(4)
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)