Q. Let L be a language over Σ = {0,1,2} defined as: No string in L contains 15…
Q. Let L be a language over Σ = {0,1,2} defined as:
No string in L contains 15 consecutive 0’s, and
Every string in L must end with 1.
Let M be the minimal DFA recognizing L.
The number of states in M is _______.
Answer: 29 — 0 to 14 15th Zero trap 15+1= 16 states for zero :2 states for 1 to 14 :2*14 =28 states 1 trap state total 31 state total distinct = 29 states
Attempted by 62 students.
Show answer & explanation
Correct answer: 29
0 to 14
15th Zero trap
15+1= 16 states
for zero :2 states
for 1 to 14 :2*14 =28 states
1 trap state total 31 state
total distinct = 29 states
A video solution is available for this question — log in and enroll to watch it.
Loading lesson…