Quiz No.01 is contain on 10 Questions each question have 1 marks and 90 second to answer... following is today quiz.....
Question No.01
Closure of an FA is same as concatenation of an FA with itself?
True
False
Question No.02
In Closure of an FA the initial state of a required FA is
Initial state of another FA
Final State of another FA
Final state as well of the same FA
None of the Given
Question No.03
NFA is a TG as well?
True
False
Question No.04
Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum number of states.
2
3
It will be more than 3.
None of them
Question No.05
Closure of an FA, is same as of an FA with itself, except that the initial state of the required FA is a final state as well.
Union
Sum
Concatenation (answer)
Intersection
Question No.06
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.
True
False
Question No.07
If R is a regular language and L is some language, and L U R is a RE then L must be a
Concatenation
Regular Language
Question No.08
There a unique path for each string in NFA?
Must be
May be
Should be
May not be
Question No.09
If a Language is accepted by an FA then there exists a TG accepting the language?
True
False
Question No.10
It is clear by the definition of NFA that a string is supposed to be accepted if there exist at least successful path
Two
One
More than one
More than two
Question No.11
Can NFA and FA be equivalent?
Yes
No
Question No.12
NFA helps to eliminate at certain state of an FA
Loop
FA
NFA
String
It is possible to convert an FA into NFA?
0 comments
Post a Comment