What is the minimum and maximum number of initial, dead, unreachable and final…
UGC NET 2022
What is the minimum and maximum number of initial, dead, unreachable and final states in a valid ‘n’ state finite automaton, where the language accepted is not ‘φ’?
- A.
Minimum: 1,1,1,1; Maximum: 1, (n-1), (n-1), n
- B.
Minimum: 1,0,0,0; Maximum: 1, (n-1), (n-1), n
- C.
Minimum: 1,0,0,n; Maximum: 1, n, (n-1), (n-1)
- D.
Minimum: 1,0,0,1; Maximum: 1, (n-1), (n-1), n
Attempted by 45 students.
Sign up free to check your answer
Sign up freeLoading lesson…

