The minimum number of states of the non-deterministic finite automation which…
PYQ UGC NET 2012
The minimum number of states of the non-deterministic finite automation which accepts the language {ababn | n ≥ 0} ∪ {aban | n ≥ 0} is:
- A.
3
- B.
4
- C.
5
- D.
6
Attempted by 79 students.
Sign up free to check your answer
Sign up freeLoading lesson…

