Handbook of theoretical computer science (vol. B)
Handbook of formal languages, vol. 3
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Logical Specifications of Infinite Computations
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
Ambiguity in omega context free languages
Theoretical Computer Science
Two-way tree automata solving pushdown games
Automata logics, and infinite games
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
| Hi-index | 0.00 |
In a recent paper [19, 20] Serre has presented some decidable winning conditions Ω $_{A_1▹…▹A_n▹A_{n+1}}$ of arbitrarily high finite Borel complexity for games on finite graphs or on pushdown graphs. We answer in this paper several questions which were raised by Serre in [19,20]. We study classes C$_n$(A), defined in [20], and show that these classes are included in the class of non-ambiguous context free ω-languages. Moreover from the study of a larger class C$_n^λ$(A) we infer that the complements of languages in C$_n$(A) are also non-ambiguous context free ω-languages. We conclude the study of classes C$_n$(A) by showing that they are neither closed under union nor under intersection. We prove also that there exists pushdown games, equipped with winning conditions in the form Ω$_{A_1▹A_2}$, where the winning sets are not deterministic context free languages, giving examples of winning sets which are non-deterministic non-ambiguous context free languages, inherently ambiguous context free languages, or even non context free languages.