Finite Automata On Infinite Inputs





Courses with significant overlap with this course:

Semester of last offering:

Date of approval: dd-mmm-yyyy


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. 


Number of sections:

Tutors for each section:

Schedule for Lectures:

Schedule for Tutorial:

Schedule for Labs:



Birds at IIT Kanpur
Information for School Children
IITK Radio
Counseling Service