Equivalence of Deterministic and Nondeterministic Epsilon Automata
| 14. Juli 2009
Über diesen Artikel
Online veröffentlicht: 14. Juli 2009
Seitenbereich: 193 - 199
DOI: https://doi.org/10.2478/v10037-009-0023-9
This content is open access.
Based 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.