Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
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 $\varphi$?
Solution
In a finite automaton:
Number of initial states is always $1$.
Minimum dead states can be $0$.
Minimum unreachable states can be $0$.
Since language accepted is not $\varphi$, at least one final state must be present.
So, minimum values are:
$1,0,0,1$
Maximum initial states $=1$
Maximum dead states $=n-1$
Maximum unreachable states $=n-1$
Maximum final states $=n$
So, correct option is:
$\boxed{(d)\ \text{Minimum: }1,0,0,1;\ \text{Maximum: }1,(n-1),(n-1),n}$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
