WorksheetsQuiz-1(Session 2023-24)
Total questions: 11
Worksheet time: 6mins
Which of the regular expressions given below represent the following DFA.
1.0*1(1+00*1)*
2. 0*1*1
3.(0+1)*1(0+1)*
1 only
2 only
3 only
1, 2 and 3
Transition Function of DFA map as:
Q × q0 → Q
Q × input→ Q
Q × output→ Q
None of these
Consider the NFA in the following figure.
What is the set of reachable states for the input string 0011?
A.{q0, q1, q2}
B.{q0, q1}
C. {q0,q1,q2, q3}
D.{q3}
A
B
C
D
Let δ denote the transition function and δ^ denote the extended transition function of the ∈−NFA whose transition table is given below: Then δ^(q2,aba) is
ϕ
ϕ
{q2}
Φ
{q0, q1, q3}
{q0, q1, q2}
{q0, q2, q3}
Which one of the following is FALSE?
There is unique minimal DFA for every regular language
Every NFA can be converted to an equivalent DFA.
Complement of every regular language is regular.
Difference of two regular language is not regular.
How many substrings of different lengths (non-zero) can be formed from a character string of length n ?
n
n^2
2^n
n(n+1) / 2
Let L={w ∈ (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
(0*10*1)*
0*(10*10*)*
0*(10*1*)*0*
0*1(10*1)*10*
The password to the admins account=” administrator”. The total number of states required to make a password-pass system using DFA would be __________
14 states
13 states
c) 12 states
d) A password pass system cannot be created using DFA
The FSM (Finite State Machine) machine pictured in the figure below represents what language?
Find 2's complement
Find 1's complement
increment bit pattern by 1
changes the sign bit
Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
n
n-1
n+1
2n-1
the length of the given string x = 01ϵ01ϵ00ϵ is:
5
6
8
9
