1. Pumping lemma is used to prove
a) Certain language are not equal
b) Certain language are not regular
c) Certain language does not exists
d) None of these
2. The regular sets are closed under
a) Union
b) Closure
c) Concatenation
d) All of these
3. Which of the following statement is
wrong?
a) Recursive language can be recognized
by finite automata
b) The class of regular sets are closed
under intersection
c) The class of regular sets are closed
under substitution
d) Regular language are recognize by
finite automata
4. Decision properties are used to
a) To test the emptiness of regular
languages
b) To test the whether the language is regular
or not
c) Both (a) and (b)
d) None of these
5. Which of the following statement is
true?
a) It is possible to test the emptiness
of regular languages
b) It is possible to test the equivalence
of regular languages
c) Both (a) and (b)
d) None of these