Construct a DFA that accepts all strings over {0, 1} that contain 010 as a substring and do not end with 0110. Correct D
Posted: Fri May 20, 2022 1:17 pm
Construct a DFA that accepts all strings over {0, 1}
that contain 010 as a substring and do not end with 0110.
Correct DFA should have 8 states
I know how a DFA works, but I just can't construct it right. Can
you share some ideas about how you construct something like this?
Like what are your steps and how do you think to solve this
question?
that contain 010 as a substring and do not end with 0110.
Correct DFA should have 8 states
I know how a DFA works, but I just can't construct it right. Can
you share some ideas about how you construct something like this?
Like what are your steps and how do you think to solve this
question?