Pages that link to "Item:Q5452202"
From MaRDI portal
The following pages link to Church’s Problem and a Tour through Automata Theory (Q5452202):
Displaying 18 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Computability and realizability for interactive computations (Q2343137) (← links)
- (Q3130542) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- Multiplayer Cost Games with Simple Nash Equilibria (Q3455836) (← links)
- LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES (Q4902889) (← links)
- (Q5002830) (← links)
- (Q5005148) (← links)
- Automated Synthesis: a Distributed Viewpoint (Q5136292) (← links)
- Diagonalisation and Church's Thesis: Kleene's Homework (Q5697424) (← links)
- (Q6134270) (← links)
- Boolean abstractions for realizability modulo theories (Q6535690) (← links)
- Realizability modulo theories (Q6561346) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)