Consider the following regular expressions R: (1+01)*(0+ϵ) The number of…
Consider the following regular expressions
R: (1+01)*(0+ϵ)
The number of states in min DFA which accept language generated by regular expression R are ______
Answer: C. 3 — Explanation: The strings generated by R are {ϵ, 0, 1, 01, 10, 010, 11, 101, 011, 0101, ………} We can notice that R generates all strings which does not have…
- A.
1
- B.
2
- C.
3
- D.
4
Attempted by 40 students.
Show answer & explanation
Correct answer: C
Explanation:
The strings generated by R are {ϵ, 0, 1, 01, 10, 010, 11, 101, 011, 0101, ………}
We can notice that R generates all strings which does not have consecutive zeros.
The min DFA is

Loading lesson…