(A) True
(B) False
(C) Depends on the language
(D) None of these
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.
If a language is expressed through TG, then that language will have its RE?
(A) True
(B) False
(C) Depends on language
(D) None of these
a*b* = (ab)* this expression is __.
(A) True
(B) False
(C) Can’t be assumed
(D) None of these
“Every finite language can be expressed by FA”. This statement is __.
(A) True
(B) False
(C) Depends on language
(D) None of these
If an alphabet has n number of letter, then number of strings of length m will be?
(A) n+m
(B) (n)(m)
(C) m^n
(D) n^m
One FA has 3 states and 2 letters in the alphabet. Then FA will have __ number of transitions in the diagram.
(A) 4
(B) 5
(C) 6
(D) 7
“One language can be expressed by more than one NFA”. This statement is __.
(A) True
(B) False
(C) Depends on NFA
(D) None of the given
In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using __ sign.
(A) –
(B) +
(C) *
(D) None of the given