Deterministic Finite Automata Examples
A collection of DFAs that recognize various regular languages
Even Number of 0s
This automaton accepts strings that contain an even number of 0s (including zero).
Language:
L = { w | w contains an even number of 0s }
No Consecutive 1s
This automaton accepts strings that do not contain two consecutive 1s.
Language:
L = { w | w does not contain the substring '11' }
Binary Numbers Divisible by 3
This automaton accepts binary strings that represent numbers divisible by 3.
Language:
L = { w | w is a binary representation of a number divisible by 3 }
Contains Substring '010'
This automaton accepts strings that contain the substring '010'.
Language:
L = { w | w contains the substring '010' }