Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
The monadic theory of morphic infinite words and generalizations
Information and Computation
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Church synthesis problem with parameters
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Regular sets of higher-order pushdown stacks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Regular sets over extended tree structures
Theoretical Computer Science
| Hi-index | 0.00 |
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular ω-language parametrized by P. In this context, an ω-word, representing a play, has letters consisting of three components: The first is a bit indicating membership of the current position in P, and the other two components are the letters contributed by the two players. Extending recent work of Rabinovich we study here predicates P where the structure (N, +1, P) belongs to the pushdown hierarchy (or "Caucal hierarchy"). For such a predicate P where (N, +1, P) occurs in the k-th level of the hierarchy, we provide an effective determinacy result and show that winning strategies can be implemented by deterministic level-k pushdown automata.