(A) Null
(B) aa
(C) bb
(D) None of given
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.
TG can more then one initial state?
(A) True
(B) False
(C) Depend on alphabets
(D) None of given
One language can represents more than one RE?
(A) True
(B) Falss
(C) Can’t be assumed
(D) Non of given
S={a,bb,bab,baabb} set of strings then S* will not have?
(A) baba
(B) baabbab
(C) bbaaabb
(D) bbbaabaabb
S= {a,bc,cc} has the latters?
(A) 1
(B) 2
(C) 3
(D) 4
Every FA should be __.
(A) Deterministic
(B) Non- Deterministic
(C) Deterministic & Non- Deterministic
(D) None of these
GTG can have __ final state.
(A) 0
(B) 1
(C) More than 1
(D) All of the given
In TG there may exist no paths for certain string?
(A) True
(B) False
(C) Depends on the language
(D) None of these