À propos de cet article
Publié en ligne: 14 juil. 2009
Pages: 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.