WorksheetsFAFL_Quiz
Total questions: 10
Worksheet time: 8mins
If Σ={a}, then Σ*=?
{ε, a, aa,…..}
{ε , a , aa}
{ε}
{a,aa,...}
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
The set of all strings containing the substring 00
The set of all strings containing at most two 0’s.
The set of all strings containing at least two 0’s
The set of all strings that begin and end with either 0 or 1.
Given the DFA transition table, what is the final state for the input string "ab"?
q0
q1
q2
no final state
What is the number states obtained after minimizing DFA?
2
3
4
5
Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must contain more than one item.
Pumping lemma
Pigeon Hole principle
Count principle
None of the mentioned
If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an empty string?
x
y
z
All of the mentioned
Which of the following is the corresponding Language to the given DFA?
L = {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}
L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}
L = {x ϵ {0,1} |x ends in 1 and does not contain substring 00}
L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}
State true or false?
Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.
True
False
Which of the following is correct?
Statement 1: ε represents a single string in the set.
Statement 2: Ф represents the language that consist of no string.
Statement 1 and 2 both are correct
Statement 1 is false but 2 is correct
Statement 1 and 2 both are false
There is no difference between both the statements, ε and Ф are different notation for same reason
If ∑= {0,1}, then Ф* will result to:
ε
Ф
∑
None of the mentioned
