(A) Will not remain NFA
(B) NFA with
(C) NFA with null string
(D) Either “NFA with null string” OR “NFA with ”
Category: Theory of Automata Mcqs
Theory of Automata Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Theory of Automata Mcqs portion from here.
The length of output string in case of __ is one more than the length of corresponding input string.
(A) Finite Automaton
(B) TG
(C) GTG
(D) None of these
TG is always deterministic?
(A) True
(B) False
(C) NA
(D) NA
“Every Infinite language is regular” this statement is?
(A) True
(B) False
(C) NA
(D) NA
Length of strings, generated by infinite language is__.
(A) finite
(B) infinite
(C) Depends on the language
(D) none of these
Using tree structure final state represent by?
(A) *
(B) –
(C) double circle
(D) None of given
In FA one enter in specific stat but there is no way to leave it then state is called?
(A) Dead States
(B) Waste Baskets
(C) Davey John Lockers
(D) All of above
In FA final state represent by __sign.
(A) +
(B) –
(C) =
(D) *