(A) 0
(B) 1
(C) More than 1
(D) All of the 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.
Above given FA accepts the language in which strings?
(A) Begins with and ends in same letter
(B) Begins with and ends in different letter
(C) Has length more than 2
(D) None of the given
If a language can be expressed through FA, then it can also be expressed through TG?
(A) True
(B) False
(C) Depends on language
(D) None of the above
If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by?
(A) (r1)(r2)
(B) (r1 + r2)
(C) (r2)*
(D) (r1)*
Let S = {aa, bb} be a set of strings then s* will have?
(A) Λ
(B) abba
(C) aabbbaa
(D) bbaab
Languages generated by kleene star are always __.
(A) Finite
(B) Infinite
(C) Sometimes finite & sometimes infinite
(D) None of the these
Σ=,a,Aa,Abb-, then string aAaAbbAa has __ length.
(A) 1
(B) 2
(C) 3
(D) 4
According to theory of automata there are __ types of languages.
(A) 1
(B) 2
(C) 3
(D) 4