Equivalence of Deterministic and Nondeterministic Epsilon Automata
Michał Trybulec · Formalized Mathematics · 2009
Equivalence of Deterministic and Nondeterministic Epsilon AutomataBased on concepts introduced in [14], semiautomata and leftlanguages, automata and right-languages, and langauges accepted by automata are defined. The powerset construction is defined for transition systems, semiautomata and automata. Finally, the equivalence of deterministic and nondeterministic epsilon automata is shown.