Accesso libero

Equivalence of Deterministic and Nondeterministic Epsilon Automata

INFORMAZIONI SU QUESTO ARTICOLO

Cita

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.

eISSN:
1898-9934
ISSN:
1426-2630
Lingua:
Inglese
Frequenza di pubblicazione:
4 volte all'anno
Argomenti della rivista:
Computer Sciences, other, Mathematics, General Mathematics