Page 1 of 1
Problem 3. Draw a DFA (6 points) Consider the following language L over Σ = {0,1}. L = {x| any two Os in x are separated
Posted: Sun Jul 10, 2022 11:30 am
by answerhappygod
- 1 (66.07 KiB) Viewed 62 times
Problem 3. Draw a DFA (6 points) Consider the following language L over Σ = {0,1}. L = {x| any two Os in x are separated by at least three 1s} For example, 01110, 01111011101111101, 11101, 1111 are all in L, but 00, 0110, 01110110 are not. Draw a DFA which recognizes L. Be sure to include all states and transitions and to denote the start and accept states. Your DFA should accept the empty string. Your DFA should be as simple as possible. Solution: