Omega Automata
Published:
Final project for CMPT 320 The Theory of Computation
Report | Slides
Theory of the infinite-word automata ($\omega$-languages)
- Introduced Buchi, Muller, and Rabin acceptance conditions
- Limits of deterministic Buchi automata
- Application in modeling and verifying non-terminating systems