Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

BIRTHDAY
2008
Springer

favoriteEmaildiscussreport

134views Applied Computing» more BIRTHDAY 2008»

Church's Problem and a Tour through Automata Theory

13 years 6 months ago

Church's Problem and a Tour through Automata Theory

Download www-i7.informatik.rwth-aachen.de

Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such that a requirement on (, ), expressed in monadic second-order logic, is satisfied. We explain how three fundamental techniques of automata theory play together in a solution of Church's Problem: Determinization (starting from the subset construction), appearance records (for stratifying acceptance conditions), and reachability analysis (for the solution of games).

Wolfgang Thomas

Real-time Traffic

Applied Computing | Automata Theory Play | BIRTHDAY 2008 | Infinite Sequence | Monadic Second-order Logic |

claim paper

Related Content

» Facets of Synthesis Revisiting Churchs Problem

» Deciding Unambiguity and Sequentiality of Polynomially Ambiguous MinPlus Automata

» Fibring Logics Past Present and Future

» Complexity of the Satisfiability Problem for a Class of Propositional Schemata

» Simulating a Human Cooperative Problem Solving

» The HOM problem is decidable

» Inclusion dynamics hybrid automata

» From Gene Trees to Species Trees through a Supertree Approach

» Towards the coevolution of cellular automata controllers for chemical computing with the B...

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	BIRTHDAY
Authors	Wolfgang Thomas

Comments (0)