CS644A - Finite Automata On Infinite Inputs
Prerequisites:
3-0-0-9
Course Contents
Finite automata on infinite words and trees: Complementation, determinization and algorithms for checking emptiness. Connections with logic: Finite automata and monadic second order (MSO) logic on words and trees. Decidability of MSO theory of various infinite graphs, methods of interpretation and unfolding. Applications: Decision procedures for temporal logics. Modeling, verification and synthesis of systems. Effective theory of infinite games.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: