07-22-2014, 04:19 PM
CS402 Theory of Automata Quiz No.3 Solutions Ideas Spring 2014 Due Date 24th July 2014
Question # 1 of 10 ( Start time: 04:12:20 PM ) Total Marks: 1
An FA has same initial and _____ state, then it means that it has no _______ state.
Select correct option:
initial, final
final, initial
initial, initial
none of the given options
Answer: 2
-----
Quiz Start Time: 04:12 PM Time Left 89
sec(s)
Question # 2 of 10 ( Start time: 04:13:44 PM ) Total Marks: 1
The product of two regular languages is __________.
Select correct option:
regular
infinite
non-regular
closure of a regular language
Answer: 1
-------
Quiz Start Time: 04:12 PM Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 04:14:36 PM ) Total Marks: 1
According to Myhill Nerode theorem, if L generates finite no. of classes then L is.......
Select correct option:
Finite
Infinite
Regular
Non regular
Answer:3
------
Quiz Start Time: 04:12 PM Time Left 90
sec(s)
Question # 4 of 10 ( Start time: 04:15:19 PM ) Total Marks: 1
Two languages are said to belong to same class if they end in the same state when they run over an FA, that state
Select correct option:
Must be final state
May be final state or not
May be start state or not
None of the given option
Answer:2
-----
Quiz Start Time: 04:12 PM Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 04:16:38 PM ) Total Marks: 1
In pref(Q in R) Q is …… to (than) R
Select correct option:
Equal
Not equal
Greater
Smaller
Answer: 2
-------
Quiz Start Time: 04:12 PM Time Left 89
sec(s)
Question # 6 of 10 ( Start time: 04:17:14 PM ) Total Marks: 1
For language L defined over {a, b},then L partitions {a, b}* into …… classes
Select correct option:
Infinite
Finite
Distinct
Non distinct
Answer: 3
-----
Quiz Start Time: 04:12 PM Time Left 88
sec(s)
Question # 7 of 10 ( Start time: 04:18:26 PM ) Total Marks: 1
Which of the following is not a true theorem?
Select correct option:
Decidability theorem
Equivalency theorem
Myhill Nerode theorem
Pseudo theorem
Answer: 4
--------
Quiz Start Time: 04:12 PM Time Left 90
sec(s)
Question # 8 of 10 ( Start time: 04:19:37 PM ) Total Marks: 1
If a regular expression contains * then it _______ define an ________ language.
Select correct option:
always, finite
may, infinite
always, infinite
None of the given options
Answer: 2
------
Quiz Start Time: 04:12 PM Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 04:20:48 PM ) Total Marks: 1
a^n b^n generates the ………… language
Select correct option:
regular
non regular
EQUAL and non regular
EQUAL and regular
Answer: 2
---------
Quiz Start Time: 04:12 PM Time Left 87
sec(s)
Question # 10 of 10 ( Start time: 04:21:23 PM ) Total Marks: 1
To examine whether a certain FA accepts any words, it is required to seek the paths _______ state.
Select correct option:
from final to initial
from initial to initial back
from final to back final
from initial to final
Answer: 4