Automated Verification: Assignment 1
Due Date: November 11, 1998
Let A=(Sigma,S,S0,rho,G) be a nondeterministic Müller
automaton, where G={F1,...Fk).
Construct a Büchi automaton Ab such that A and
Ab define the same omega-language. Prove the correctness of your
construction.
Note: The assignment need to be typeset.