Consider the language L over Σ = (a, b) given below: L = ‘w’ is an odd length…
Consider the language L over Σ = (a, b) given below: L = ‘w’ is an odd length string containing exactly one ‘b’.
The total number of final and non-final states in minimal DFA is/are ____ and ____ respectively.
Answer: A. 1, 4
- A.
1, 4
- B.
4, 1
- C.
2, 4
- D.
4, 2
Attempted by 67 students.
Show answer & explanation
Correct answer: A
Loading lesson…