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.