- #1
Opso
- 1
- 0
Homework Statement
Give state diagrams of DFAs recognizing the following languages. In all parts the alphabet is {0,1}.
{w | w has length at least 3 and its third symbol is a 0}
Homework Equations
If the final state only has one circle it is rejected, if two, accepted.
The Attempt at a Solution
I am just wondering if this is the most efficient way of doing this problem, or do I have too many states?
Oh also, I forgot to add an arrow pointing to qs indicating the start.
Last edited: