NEW
Font size
S
M
L
XL
WorksheetsTOC-U1-1
Total questions: 7
Worksheet time: 4mins
Name
Class
Date
1.
There are ________ tuples in finite state machine.
a)
4
b)
5
c)
6
d)
7
2.
Transition function maps.
a)
Σ * Q -> Σ
b)
Q * Q -> Σ
c)
Σ * Σ -> Q
d)
Q * Σ -> Q
3.
Number of states require to accept string ends with 10.
a)
3
b)
2
c)
1
d)
can’t be represented.
4.
The basic limitation of finite automata is that
a)
It can’t remember arbitrary large amount of information
b)
It sometimes recognize grammar that are not regular
c)
It sometimes fails to recognize regular grammar.
d)
All of the mentioned
5.
If NFA of 7 states is converted into DFA, maximum possible number of states for the DFA is ?
a)
64
b)
132
c)
128
d)
127
6.
The sum of minimum and maximum number of final states for a DFA n states is equal to:
a)
n+1
b)
n
c)
n-1
d)
n+2
7.
Concatenation of R with Ф outputs
a)
R
b)
Ф
c)
R.Ф
d)
None
Reset
