Q1
A DFA with n states must accept at least one string of length greater than n.
Choices:
True
False
Q2
FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having
Choices:
no transition at certain state
one transition at certain state
more than one transitions at certain state
none of the given options
Q3
Which of the following statement is NOT true?
Choices:
FA can be considered to be an NFA
FA can be considered to be an NFA with null string
NFA can be considered to be an TG
TG can be considered to be an NFA
Q4
For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the same.
Choices:
False
Q5
Does the empty string match the regular expression |y+a|?
Choices:
Yes
No
Q6
If an FA already accepts the language expressed by the closure of certain RE, then the given FA is the required FA.
Choices:
True
False
Q7
Which of the following statement is true about NFA with Null String?
Choices:
Infinite states
Infinite set of transitions
Transition of null string is allowed at any stage
Q8
If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language.
Choices:
True
False
Q9
FA corresponding to an NFA can be built by introducing an empty state for a letter having
Choices:
no transition at certain state
one transition at certain state
two transition at certain state
more than two transitions at certain state
Q10
Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of
Choices:
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
No comments:
Post a Comment