A class of languages that is closed under

Choose one answer.

1. union and complementation has to be closed under intersection
2. union and intersection has to be closed under complementation
3. all of the above
Correct
Marks for this submission: 1/1.
Question2
Marks: 1
The language that can be expressed by any regular expression is
called a Nonregular language.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question3
Marks: 1
Languages are proved to be regular by using pumping lemma.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question4
Marks: 1
.. is a finite set of symbols.
Choose one answer.
1. Word
2. Letter
3. Alphabet

4. Language
Correct
Marks for this submission: 1/1.
Question5
Marks: 1
The regular expression corresponds to the set {abb, a, b, bba} is
Choose one answer.
1. Abb
2. a + b
3. Bba
4. abb + a + b + bba
Correct
Marks for this submission: 1/1.
Question6
Marks: 1
The regular expression associated to some finite automaton is
necessarily unique
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question7
Marks: 1
The language {anbn| n 1} is accepted by a finite automaton.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question8
Marks: 1
If is finite then * is finite

Answer:
True

False

Correct
Marks for this submission: 1/1.
Question9
Marks: 1
Two finite state machines are equivalent if
Choose one answer.
1. They have same number of states and edges
2. They have same number of edges
3. They recognize the same language
4. They have same number of states
Correct
Marks for this submission: 1/1.
Question10
Marks: 1
If R1 and R2 are regular expressions, then R1+R2 is also a regular
expression.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question11
Marks: 1
The word "formal" in "formal languages" means
Choose one answer.
1. the symbols used have well-defined meaning
2. they are unnecessary, in reality
3. only the form of the string of symbols is significant

4. None of the above

Correct
Marks for this submission: 1/1.
Question12
Marks: 1
By the definition of Kleene closure for a language L, L* is always infinite language
regardless what L is.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question13
Marks: 1
The difference between DFSA and NDFSA is
Choose one answer.
1. In DFSA, transitions may be present
2. In NDFSA, transitions may be present

3. In DFSA, from any given state, there can't be any alp

states
4. None of the above
Correct
Marks for this submission: 1/1.
Question14
Marks: 1
The recognizing capability of NDFSM and DFSM
Choose one answer.
1. may be different
2. must be different
3. must be the same

4. None of the above

Correct
Marks for this submission: 1/1.
Question15
Marks: 1
The finite automata associated to some regular expression is
necessarily unique
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question16
Marks: 1
Any language that can not be expressed by a RE is said to be
regular language.
Answer:
True

False

Correct
Marks for this submission: 1/1.
Question17
Marks: 1
Regular language is
Choose one answer.

1. Set of strings for which there exist some finite automata acce
2. Set of FA which accepts regular expression
3. Set of NFA which accepts regular expression
4. None of the above
Correct
Marks for this submission: 1/1.
Question18
Marks: 1

Dead states are defined as

Choose one answer.
1. No such state exist

2. A dead state is nonfinal state of a DFA whose transition on ever

itself
3. It is non-distinguishable state
4. None of the above
Correct
Marks for this submission: 1/1.
Question19
Marks: 1
Pumping lemma is generally used for proving
Choose one answer.
1. a given grammar is regular
2. a given grammar is not regular
3. whether two given regular expressions are equivalent
4. None of the above
Correct
Marks for this submission: 1/1.
Question20
Marks: 1
If R1 and R2 are regular expressions, then (R1/R2) is also a regular
expression.
Answer:
True

False

Correct
Marks for this submission: 1/1.