Church’s Problem and a Tour through Automata Theory

DOI10.1007/978-3-540-78127-1_35zbMath1133.68367OpenAlexW1569390362MaRDI QIDQ5452202

Wolfgang Thomas

Publication date: 25 March 2008

Published in: Pillars of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (14)

Distributed synthesis for well-connected architectures ⋮ The mu-calculus and Model Checking ⋮ Multiplayer Cost Games with Simple Nash Equilibria ⋮ Infinite games specified by 2-tape automata ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Unnamed Item ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES ⋮ Unnamed Item ⋮ Computability and realizability for interactive computations ⋮ Automated Synthesis: a Distributed Viewpoint

Cites Work

• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Infinite games played on finite graphs
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• On the synthesis of strategies in infinite games
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Church’s Problem and a Tour through Automata Theory