(A) FA1
(B) FA2
(C) May be both
(D) None of the given
Tag: Theory of Automata Mcqs
According to 3rd part of the Kleene’s theorem, If a language can be accepted by an RE then it can be accepted by a __ as well.
(A) TG
(B) FA
(C) G and FA
(D) None of these
(a + b)*b is RE for the language defined over S={a,b} having words not ending in a?
(A) True
(B) False
(C) Such a language is not regular
(D) None of these
One language can be represented by more than one RE” this statement is__.
(A) True
(B) False
(C) Can’t be assumed
(D) None of these
Which statement is true?
(A) All words are strings
(B) All strings are words
(C) Both are always same
(D) None of these
If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 + r2 will be __.
(A) Regular
(B) Ir-regular
(C) Can’t be decided
(D) Another Language which is not listed here
One FA has n states and m letters in the alphabet. Then FA will have __ number of transitions in the diagram.
(A) (n)+(m)
(B) (m)-(n)
(C) (m)(n) OR (n)(m)
(D) None of the given options
GTG can have __ initial state.
(A) Zero
(B) One
(C) More than One
(D) One OR more than One