Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Monadic second-order logic on tree-like structures
Theoretical Computer Science
The monadic theory of morphic infinite words and generalizations
Information and Computation
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
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Parametrized regular infinite games and higher-order pushdown strategies
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
The following problem is known as the Church Synthesis problem: Input: an ${\mathit{MLO}}$ formula ψ(X,Y). Task: Check whether there is an operator Y=F(X) such that$$Nat \models \forall X \psi(X,F(X))$$ and if so, construct this operator. Büchi and Landweber proved that the Church synthesis problem is decidable; moreover, they proved that if there is an operator F which satisfies ([1]), then ([1]) can be satisfied by the operator defined by a finite state automaton. We investigate a parameterized version of the Church synthesis problem. In this version ψ might contain as a parameter a unary predicate P. We show that the Church synthesis problem for P is computable if and only if the monadic theory of $\langle{\mathit{Nat},