Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
com
FLAT
1. The prefix of abc is _ _ _ _ _ _ _ _ _ _ _ _ [01S01]
a. c
b. b
c. bc
d. e
2. The suffix of abc is _ _ _ _ _ _ [01S02]
a.
ab.b ac
c. b
d. ab
3. Which of the following is not a prefix of abc? [01S03]
a. e
b. a
c. ab
d.
bc
4. Which of the following is not a suffix of abc ? [01S04]
a. e
b. c
c. bc
d.
ab
5. _ _ _ _ _ _ _ _ _ [02D01]
a.
b.
c.
d.
6. _ _ _ _ _ _ _ _ _ _ _ [02D02]
a.
b.
c.
d.
7. Which of the following is not a proper prefix of doghouse ? [02M01]
a. dog
b. d
c. do
d. doghouse
8. Which of the following is not a proper suffix of doghouse ? [02M02]
a. house
b. se
c. e
d. doghouse
9. If then the number of possible strings of length 'n' is _ _ _ _ _ _ _ _ [02M03]
a. n
b. n * n
c. n n
d. 2 n
10. The concatenation of e and w is _ _ _ _ _ _ [02S01]
a. e
b.
w c.
d.
11. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ is a set of strings . [02S02]
a. Language
b. grammar
c. NFA
p
s
g
.
t
o
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 1 of 18
m
o
c
d. DFA
12. _ _ _ _ _ _ _ _ _ _ _ _ is a finite sequence of symbols. [02S03]
a. Language
b. grammar
c. string
d. NFA
13. Let a is any symbol , x is a palindrome then which of the following is not a
palindr[o0m2Se.04]
a. e
b. a
c. axa
d.
xa
14. Let a is any symbol , x is a palindrome then which of the following is a palindrome.
[02S05]a. e
b. xa
c. ax
d. aax
15. The basic limitation of FSM is that _ _ _ _ _ _ _ _ [03D01]
a. it can't remember arbitrary large amount of
ibn. fiot rsmomateitoimnes recognizes grammars that are not regular
c. it some times fails to recognize grammars that are regular
d. it can remember arbitrary large amount of information
16. The number of states of the FSM required to simulate the behaviour of a computer with
a memory capable of storing m words each of length n bits is _ _ _ _ _ [03D02]
a. m
b.
c. 2mn
d. 2m
17. We formally denote a finite automaton by ( Q, ,q0 , F) Where is the transition
function
mapping from Q X to _ _ _
[03M01]
a. Q
b.
c. q0
d. F
18. Application of Finite automata is _ _ _ _ _ _ _ _ _ _ _ [03M02]
a. Lexical analyzer
b. parser
c. scanner
d. semantic analyzer
19. An FSM can be used to add two given integers .This is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [03M03]
a. true
b. false
c. may be true
d. can't say
20. We formally denote a finite automaton by a _ _ _ _ _ _ _ _ tuple. [03S01]
a. 3
b. 4
c. 5
d. 6
21. We formally denote a finite automaton by Where Q is _ _ _ [03S02]
a. a finite set of states
b. finite input alphabet
c. initial state
d. A set of final states
22. We formally denote a finite automaton by Where is _ _ _ [03S03]
a. a finite set of states
b. finite input
acl.p ihniatbiaelt state
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 2 of 18
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 3 of 18
c. DFA &NFA
d. can't say
34. Finite state machine _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ recognize palindromes [04S05]
a. can
b. can't
c. may
d. may not
35. FSM can recognize _ _ _ _ _ _ _ _ _ _ [05D01]
a. any grammar
b. only CFG
c. any unambiguous grammar
d. only regular grammar
36. Palindromes can _ t be recognized by any FSM because [05D02]
a. an FSM can't remember arbitrarily large amount of
ibn. faonr mFSaMtio cnan deterministically fix the mid point
c. an FSM can find whether the second half of the string matches the first half or not
d. an FSM can remember arbitrarily large amount of information
37. Let M = ( Q,S, ,q0 , F) , F= { q0 } , S= {0,
1 }. :
Then ( q0 , 110101 ) _ _ _ _ _ _ _ _ _ _ _ _ [05M01]
a. q0
b. q1
c. q2
d. q3
38. Let M = ( Q,S, ,q0 , F) , F= { q0 } , S= {0,
1 }. :
Then L(M) is the set of strings with _ _ _ _ number of 0's and _ _ _ _ _ _ _ _ _ Number of 1's.
[05M02]
a. odd, odd
b. odd, even
c. even,
de.v eevnen, odd
39. Let M = ( Q,S, ,q0 , F) , F= { q0 } , S= {0,
1 }. :
Then ( q0 , 110) _ _ _ _ _ _ _ _ _ _ _ _ [05M03]
a. q0
b. q1
c. q2
d. q3
40. Let M = ( Q,S, ,q0 , F) , F= { q0 } , S= {0,
1 }. :
Then which of the following is accepted _ _ _ _ _ _ _ _ _ _ _ _ [05S01]
a. 110101
b. 11100
c.
d0.0 011
111000
41. Let M = ( Q,S, ,q0 , F) , F= { q0 } , S= {0,
1 }. :
Then which of the following is not accepted _ _ _ _ _ _ _ _ _ _ _ _ [05S02]
a.
b1.1 10110001
c. 0011
d. 1101
42. In transition diagrams states are represented by _ _ _ _ _ _ _ _ _ _ _ _ [05S03]
a. ellipses
b. circles
c. triangles
d. rectangles
43. In transition diagrams a state pointed by an arrow represents the _ _ _ _ _ _ _ state. [05S04]
a. final
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 4 of 18
b. interior
c. start
d. final or start
44. In transition diagrams a state encircled by another represents _ _ _ _ _ _ _ state. [05S05]
a. final
b. interior
c. start
d. final or start
45. Let L = { x / x is a string of 0's and = perfect square } Then L= _ _ _ _ _ _ [06D01]
a.
b.
c.
d.
46. In NFA is a map from Q X to _ _ _ _ _ _ _ _ _ _ _ _ _ _ [06G01]
a. Q
b. 3 q
c. 2 q
d. 4 q
47. Let L be a language recognizable by a FA.The language REVERSE(L) ={ w such that w is
the reverse of v where v belongs to L } is a _ _ _ _ _ _ _ language . [06M01]
a. regular
m
o
c
.
t
o
p
s
g
5
b. CFL
c. CSL
d.
REL
48. NFA stands for _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [06S01]
a. Non deterministic finite
ab.u Ntoomna dteotnerministic finite analysis
c. Non deterministic finite acceptance
d. Non deterministic finite authorization
49. Consider the following NFA
Now ( q0, 01 ) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [06S02]
a. {q0 ,
bq.1 { }q0 , q3,q4 }
c. {q0 , q1, q4 }
d. {q4 }
50. Consider the following NFA
Now ( q0, 010) = _ _ _ _ _ _ _ _ _ _ [06S03]
a. {q0 , q1 }
b. {q0 ,
qc3. {}q0 , q1, q4 }
d. {q4 }
51. Consider the following NFA
Now ( q0, 01001 ) = _ _ _ _ _ _ _ _ _ _ [06S04]
a. {q0 , q1 }
b. {q0 , q3 }
c. {q0 , q1,
dq.4 { }q4 }
52. Consider the following NFA
Now ( q0, 0 ) = _ _ _ _ _ _ _ _ _ _ [06S05]
a. {q0 , q1 }
b. {q0 , q3 }
c. {q0 , q1,
dq.4 { }q4 }
53. Consider the following NFA as shown in figure (a) .
Figure(a)
The NFA can accept the string w=002 by the path _ _ _ _ _ [07D01]
a. q0 q0 q0 q1 q2
bq.2 q0 q0 q1 q2 q2
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 5 of 18
c. q0 q1 q2 q2
d. q0 q0 q1 q2
54. Consider the following NFA as shown in figure (a) .
Figure(a)
The NFA can accept the string w=0 by the path _ _ _ _ _ [07D02]
a. q0 q0 q0 q1 q2 q2
b. q0 q0 q1 q2 q2
c. q0 q1 q2 q2
d. q0 q0 q1
q2
55. Consider the following NFA as shown in figure (a) .
Figure(a)
Now e - closure (q1) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [07M01]
a. { q2 }
b. { }
c. { q0,q1,q2 }
d. { q1
,q2 }
56. Consider the following NFA as shown in figure (a)
Figure(a)
Now e - closure (q2) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [07M02]
a. { q2 }
b.
{c .} { q0,q1,q2 }
d. { q1 ,q2 }
57. Consider the following NFA as shown in figure (a) .
Figure(a)
Which of the following is not accepted by NFA _ _ _ [07M03]
a. 222
b. 000
c. 002
d. 012
58. The FSM pictured in figure (a) recognizes
Figure(a)
[07S01]
a. any string of odd number of a's
b. any string of odd number of a's and even number of b's
c. any string of even number of a's and even number of
db.' sany string of even number of a's and odd number of b's
59. Consider the following NFA as shown in figure (a)
Figure(a)
Now e - closure (q0) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [07S02]
a. { q2 }
b. { }
c.
d{. q{0 q,q11 ,,qq22 }}
60. Let NFA has a finite number n of states ,the DFA will have at most _ _ _ _ _ _ _ _ states.
[08D01]
a. 2n
b. n/2
c. n 2
d. 2 n
61. Let NFA has a finite number 6 of states ,the DFA will have at most _ _ _ _ _ _ _ _ states.
[08D02]
a. 12
b. 2
c. 36
d. 64
62. Which of the following can be recognized by a DFA ? [08M01]
a. 1,2,4,--------Z
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 6 of 18
n ---------------------
written in
b. 1,2,4,--------- n binary
Z
--------------------- written in unbinary
c.
d{. 1,101,------------- }
{ 1,11,111,------------------ }
63. For the numbers 1,2,4,--------- Zn --------------------- written in binary' DFA is
[08M02a]. shown in figure (a)
Figure(a)
b. shown in figure (a)
Figure(a)
c. shown in figure (a)
Figure(a)
d. shown in figure (a)
Figure(a)
64. Which of the following can be recognized by the following DFA as shown in figure (a) ?
Figure(a)
[08M03]
a. 1,2,4,--------- Zn --------------------- written in
bb.in a1r,y2,4,--------- Zn --------------------- written in
ucn. binary
d{. 1,101,------------- }
{ 1,11,111,------------------ }
65. Can a DFA simulate NFA ? [08S01]
a. No
b. Yes
c. sometimes
d. depends on NFA
66. The DFA start state = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [08S02]
a. NFA start state
b. NFA final state
c. closure( NFA start state )
d. closure ( NFA final state)
67. Let maximum number of states in a DFA =64 .Then it's equivalent NFA has _ _ _ _ _ _ _ _ _ _ _
_ _ _ _ states. [08S03]
a. 2
b. 4
c. 8
d. 6
68. Let maximum number of states in a DFA =128 .Then its equivalent NFA has _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ states. [08S04]
a. 5
b. 7
c. 8
d. 9
69. Let maximum number of states in a DFA =1024.Then it's equivalent NFA has _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ states. [08S05]
a. 5
b. 7
c. 10
d. 11
70. Choose the wrong statement [09D01]
a. Moore and mealy machines are FSM's with output capability
b. Any given moore machine has an equivalent mealy machine
c. Any given mealy machine has an equivalent moore machine
d. Moore machine is not an
FSM
71. Choose the wrong statement [09D02]
a. A mealy machine generates no language as such
b. A Moore machine generates no language as such
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 7 of 18
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 8 of 18
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 9 of 18
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 10 of 18
b.
c. 2* 1* 0*
d. 0* 1* 2*
104. The regular expression (1 + 10) * denotes all strings of 0's and 1's beginning with _ _ _ _ _ _
_ _ _ _ _ _ _ and not having two consecutive _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [12M03]
a. 1, 0's
b. 0, 1's
c. 0, 0's
d. 1, 1's
105. Let r and s are regular expressions denoting the languages R and S. Then ( r + s) denotes _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [12S01]
a. RS
b. R*
c. RUS
d. R+
106. Let r and s are regular expressions denoting the languages R and S. Then (r s) denotes _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ [12S02]
a. RS
b. R*
c. RUS
d. R+
107. Let r and s are regular expressions denoting the languages R and S. Then ( r*) denotes _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ [12S03]
a. RS
b. R*
c. RUS
d. R+
108. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ denotes all strings of 0,s and 1,s. [12S04]
a. ( 0+
b1.) 01
c. 0* 1
d. ( 0+ 1)*
109. (0+1) * 011 denote all strings of 0's and 1's ending in _ _ _ _ _ _ _ _ _ _ _ [12S05]
a. 0
b. 0111
c. 011
d. 111
110. Let r, s, t are regular expressions. (r* s *) * = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13D01]
a. ( r-s)*
b. (r s)*
c. ( r +s)*
d. (s-r)*
111. Let r, s, t are regular expressions. ( r + s)* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13D02]
a. r *s*
b. (rs)*
c. (r* s *) *
d. r *+s*
112. Let r, s, t are regular expressions. F* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13M01]
a. F
b. e
c.
d.
113. Let r, s, t are regular expressions. ( r* )* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13M02]
a. r
b. r*
c. F
d.
114. Let r, s, t are regular expressions. ( e + r )* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13M03]
a. r
b. e
c. r*
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 11 of 18
d. e r
115. Let r, s, t are regular expressions. r + s = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13S01]
a. r s
b. s + r
c. s r
d. r / s
116. Let r, s, t are regular expressions. ( r + s) +t = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13S02]
a. r +(s +t)
b. r s t
c. r t
d. s t
117. Let r, s, t are regular expressions. ( r s ) t = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13S03]
a. r s
b. r t
c. r(st)
d. s t
118. Let r, s, t are regular expressions. r( s+ t) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13S04]
a. r s
b. r t
c. rs - r t
d. rs +r t
119. Let r, s, t are regular expressions. (r + s) t = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [13S05]
a. r t +st
b. (r-s)t
c. (rs) t
d. t(rs)
120. In NFA for r=e the minimum number of states are _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14D01]
a. 0
b. 1
c. 2
d. 3
121. In NFA for r=F the minimum number of states are _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14D02]
a. 0
b. 1
c. 2
d. 3
122. In NFA for r=a the minimum number of states are _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14M01]
a. 0
b. 1
c. 2
d. 3
123. ( e + 00 )* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14M02]
a. e
b. 0
c. e 0
d. (00 )*
124. 0 (00)* ( e + 0)1 + 1 = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14M03]
a. 00* 1 + 1
b. 00* 1
c. 0 *1 +1
d. 00*+1
125. Consider the following automata as shown in figure (a)
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14S01]
a. 1
b. 1 1*
c. 1* 1
d. 1*
126. Consider the following automata as shown in figure (a)
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ [14S02]
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 12 of 18
a. e
b.
c. a
d. b
127. Consider the following automata as shown in figure (a)
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ [14S03]
a. e
b.
c. a
d. b
128. Consider the following automata as shown in figure (a)
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ _ _ [14S04]
a. 1
b. 1 1*
c. 01*
d. 1*
129. 1 + 01 = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [14S05]
a. e + 0
b. (e + 0) 1
c. 1 (e +
d0.) 101
130. Let f(0) =a and f(1) =b* Then f(010) = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [15D01]
a. a
b. b*
c. a b* a
d. aba
131. Let f(0)=a and f(1) = b* If L is the language 0*(0+1)1* then f(L)= _ _ _ _ [15D02]
a. ab
b. a b*
c. b*
d. a*
b*
132. Let L1 be 0*10* and L2 be 1 0* 1 The quotient of L1 and L2 is _ _ _ _ _ _ _ [15M01]
a.
ebm. 0p*ty
c. 1
d. 10*
133. Let L1 be 0*10* and L2 be 0* 1 The quotient of L1 and L2 is _ _ _ _ _ _ _ [15M02]
a. empty
b. 0*
c. 1
d. 10*
134. Let L1 be 10* 1 and L2 be 0* 1 The quotient of L1 and L2 is _ _ _ _ _ _ _ [15M03]
a. empty
b. 0*
c. 1
d. 10*
135. 'The regular sets are closed under union' is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [15S01]
a. True
b. False
c. True or False
d. can't say
136. 'The regular sets are closed under concatenation' is _ _ _ _ _ _ _ _ [15S02]
a. True
b. False
c. True or False
d. can't say
137. 'The regular sets are closed under kleene closure' is _ _ _ _ _ _ _ _ _ _ [15S03]
a. True
.
t
o
m
o
c
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 13 of 18
b. False
c. True or False
d. can't say
138. 'The regular sets are closed under intersection' is _ _ _ _ _ _ _ _ _ _ _ _ _ [15S04]
a. True
b. False
c. True or False
d. can't say
139. The class of regular sets is closed under complementation .That is if Lis a regular set and L is
subset or equal to * then _ _ _ _ _ _ _ _ _ _ _ _ _ is regular set [15S05]
a.
b. *
c. * + L
d. * -
m
o
c
L
140. The language is generated by the right linear grammar _ _ _ _ _ _ _ _ [16D01]
a.
b.
c.
d.
141. The language is generated by the left linear grammar _ _ _ _ _ _ _ _ [16D02]
a.
b.
c.
d.
142. Let A,B are non terminals , w is a (possibly empty) string of terminals. Then left linear
grammar form is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [16M01]
a.
b.
c.
d.
143. The left linear grammar generates _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [16M02]
a. 010
b.
c.
d.
144. The right linear grammar , A10A/? generates _ _ _ _ _ _ _ _ _ _ _ _ _ _ [16M03]
a.
b.
c.
d.
145. Regular grammars also known as _ _ _ _ _ _ _ _ _ _ _ _ grammar. [16S01]
a. Type 0
b. Type 1
c. Type 2
d. Type
3
146. _ _ _ _ _ _ _ _ _ _ _ _ _ _ grammar is also known as Type 3 grammar. [16S02]
a. un restricted
b. context free
c. context sensitive
d. regular grammar
147. Which of the following is related to regular grammar ? [16S03]
a. right linear
b. left linear
c. Right linear & left linear
d. CFG
148. Let A,B are non terminals , w is a (possibly empty) string of terminals. Then right linear
grammar form is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [16S04]
a.
b.
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 14 of 18
c.
d.
149. Regular grammar is a subset of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ grammar. [16S05]
a. Type 0 .
b. Type 1
c. Type 2
d. Type 0,1 &2
150. P,Q,R are three languages .If P and R are regular and if PQ=R then [17D01]
a. Q has to be regular
b. Q can not be regular
c. Q need not be regular
d. Q has to be a CFL
151. Let A = {0,1 } L= A * Let R = { 0 n1n , n >0 } then LUR is regular and R is _ _ [17D02]
a. regular
b. not regular
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 15 of 18
da.a abbcacbdccd
160. Which of the following CFG`s can`t be simulated by an FSM
[18D01] a.
b.
c.
d.
161. Let L1 = { n.m =1,2,3 .... }
L2 = { n ,m=1,2,3 .... }
L3 = { n =1,2,3 .... }
Choose the correct answer [18D02]
a. L3= L1 intersection L2
b. L1,L2 ,L3 are
Cc.F LL1,L2 not CFL L3 is
dC. FLL1 is a subset of L3
162. The following CFG
Is not equivalent to the regular expression [18M01]
m
o
c
.
t
o
a.
b. (a+b) +
c. (a+b) (a+b) *
d. (a+b) * (a+b)
163. Choose the wrong statement [18M02]
a. All languages can be generated by
bC.F AGny regular language has an equivalent CFG
c. Some non regular languages can _ t be generated by CFG
d. Some regular languages can be simulated by an FSM
164. In CFG each production is of the form Where A is a variable and is string of
symbols
from _ _ _ _ _ _ _ _ _ _ ( V,T are variables and terminals ) [18S01]
a. V
b. T
c. VUT
d. *
(VUT)
165. Any string of terminals that can be generated by the following CFG
[18S02]
a. ha s atleast one b
b. should end in a 'a'
c. has no consecutive a's or b's
d. has atleast two a's
166. CFG is not closed under [18S03]
a. union
b. kleene star
c.
dc.o pmropdleumctentation
167. The set A= { n=1,2,3 ..... } is an example of a grammar that is [18S04]
a. regular
b. context free
c. not context free
d. can`t say
168. Consider the following subtree of a derivation tree as shown in figure (a) .It is also called as _
_____
Figure(a)
[19D01]
a. A-tree
b. S-tree
c. ab-tree
d. abba tree
169. Consider the following derivation tree(S=start symbol ) as shown in figure (a)
Figure(a)
The above tree is also known as _ _ _ _ _ _ _ _ _ _ [19D02]
a. A tree
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 16 of 18
b. B tree
c. aba tree
d. S tree
170. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if If n has label A
and vertices n1,n2-----nk are the sons of vertex n ,in order from the left with labels X1,X2,X3----Xk
respectively then _ _ _ _ _ _ _ _ _ _ _ _ must be a production in P. [19M01]
a.
b.
c.
d.
171. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if If vertex n has
label ? then n is a _ _ _ _ node [19M02]
a. root
b. interior
c. root or interior
d. leaf
172. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if If vertex n has label
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 17 of 18
m
o
c
.
t
o
p
s
g
o
l
b
.
9
d
l
r
o
w
e
v
i
t
a
e
r
c
Page 18 of 18