Deterministic Finite Automata: Examples
00(1|0)*11
This automaton recognizes:
sequences of digits that
begin at least with two 0 and finish with at least two 1, i. e.
the language
00(1|0)*11
.
Local users:
to run simulation
(read here before running).
If AUTOMATA is already running, you'd better
load the file example04.aut
from the main menu
bar.
Actions:
- choose between a step by step simulation or a fast process
- write an input string directly from keyboard