Questions for the oral exam

1. How to convert an LTL formula to an alternating Büchi automaton
2. How to convert an alternating Büchi automaton to a nondeterministic Büchi automaton
3. Preservation of regularity for pushdown automata (the inverse image of the reachability relation of a regular set of configurations is regular)
4. Preservation of regularity for lossy channel systems
5. State-space reduction (quotienting) of nondeterministic Büchi automata with direct simulation
6. Decidability of nonemptiness of timed automata
7. Decidability of the size-change termination problem
8. Proof of the Büchi-Landweber’s theorem (any)
9. Equivalence between rational series and bilinear control systems
10. Computability of the measure of ω-regular properties of finite-state Markov chains