WWW.UandiSTAR.ORG
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]
b. finite input
acl.p ihniatbiaelt state



WWW.UandiSTAR.ORG
23. We formally denote a finite automaton by Where
Q
is _ _ _ [03S04] 0
c. initial state
24. We formally denote a finite automaton by Where F is _ _ _ [03S05]
c. initial state
25. An automation is a _ _ _ _ _ _ _ _ _ _ _ _ _ device [04D01]
a. generative
b. cognitive
c. acceptor
d. can't say
26. A grammar is a _ _ _ _ _ _ _ _ _ _ _ _ _ device [04D02]
a. generative
b. cognitive
c. acceptor
d. can't say
27. An FSM can be used to add two given integers .This is _ _ _ _ _ _ _ _ [04M01]
a. true
b. false
c. may be true
d. can't say
28. An FSM can be used to perform subtracttion of given two integers .This is _ _ [04M02]
a. true
b. false
c. may be true
d. can't say
29. Consider the following FSM's as shown in figure (a) and figure (b) .
Figure(a)
Figure(b)
Now pick the correct one [04M03]
a. both are equivalent
b. the second FSM accepts e only
c. the first FSM accepts nothing
d. both are not
equivalent
30. The word formal in formal languages means _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [04S01]
a. the symbols used have well defined meaning
b. they are unnecessary in reality
c. only the form of the string of symbols is significant
d. only the form of the string of symbols is not significant
31. The recognizing capability of NDFSM and DFSM [04S02]
a. may be different
b. must be different
c. must be same
d. may be same
32. Any given transition graphs has an equivalent _ _ _ _ _ _ _ _ _ _ _ _ _ _ [04S03]
a. RE
b. DFA
c. NFA
d. DFA,NFA &
RE
33. Which of the following recognizes variable prefixes of the grammar ? [04S04]
a.
bD.F NAFA



WWW.UandiSTAR.ORG
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



WWW.UandiSTAR.ORG
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
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 }
Now ( q0, 010) = _ _ _ _ _ _ _ _ _ _ [06S03]
a. {q0 , q1 }
b. {q0 ,
qc3. {}q0 , q1, q4 }
d. {q4 }
Now ( q0, 01001 ) = _ _ _ _ _ _ _ _ _ _ [06S04]
a. {q0 , q1 }
b. {q0 , q3 }
c. {q0 , q1,
dq.4 { }q4 }
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



WWW.UandiSTAR.ORG
c. q0 q1 q2 q2
d. q0 q0 q1 q2
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
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 }
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



WWW.UandiSTAR.ORG
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



WWW.UandiSTAR.ORG
c. A Mealy machine has no terminal state
d. A Mealy machine has terminal state
72. The major difference between a mealy and a moore machine is that
[09M01a]. The output of the former depends on the present state and present input
b. The output of the former depends only on the present
sct.a Ttehe output of the former depends only on the present input
d. The output of the former doesn't depends on the present state
73. In the method of minimizing the number of states of DFA M inputs are _ _ _ _ [09M02]
a. states, input symbols only
b. states only
c. states, input symbols , transitions
d. transitions only
74. In the method of minimizing the number of states of DFA M, output is a DFA which accepts
the _ _ _ _ _ _ _ _ _ _ language and with _ _ _ _ _ _ _ _ _ _ _ states [09M03]
a. same, 1
b. same ,more number than M
c. same ,few
d. different, few
75. A moore is a six tuple .Which of the following is not related a DFA & is related to a moore
machine [09S01]
a. states
b. output
acl.p ihnpaubte talphabet
d. final state
76. Consider the following moore machine as shown in figure (a)
Figure(a)
The output related to Q0 is _ _ _ _ _ _ _ _ _ _ _ _ [09S02]
a. 0
b. 1
c. 2
d. 3
Figure(a)
a. 0
b. 1
c. 2
d. 3
Figure(a)
a. 0
b. 1
c. 2
d. 3
79. Consider the following moore machine as shown in figure (a) .
Figure(a)
The output alphabet is _ _ _ _ _ _ _ _ _ _ _ _ [09S05]
a. { 0,1 }
b. {1,2 }
c. { 0,1,2 }
d. {0,2 }
80. Consider the following mealy machine M as shown in figure (a)
Figure(a)
The response of M to input 01100 is _ _ _ _ _ _ _ _ _ _ _ _ _ [10D01]
a.
bn.n nyynnyy
c. nny
d. nnyn
81. Consider the following mealy machine M as shown in figure (a)
Figure(a)



WWW.UandiSTAR.ORG
The response of M to input _ _ _ _ _ _ _ _ _ _ is nnyny [10D02]
a. 011
b. 01100
c.
d0.0 00101010
Figure(a)
On input _ _ _ _ _ _ _ the ouput sequence is 01221 [10M01]
a. 101
b. 1010
c. 010
d. 111
83. In a moore machine is a mapping from _ _ _ _ _ _ _ _ _ _ _ to _ _ _ _ _ _ _ _ [10M02]
a. , Q
b.
Qc. ,Q ,
d. , Q
84. In a moore machine is a mapping from _ _ _ _ _ _ _ _ _ _ _ to _ _ _ _ _ _ _ _ [10M03]
a. Q
X,
b. , Q X
c. Q ,
d. , Q
85. A moore machine is a _ _ _ _ _ _ _ _ _ _ _ _ tuple. [10S01]
a. 4
b. 5
c. 6
d. 7
86. In moore machine _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ shows the output alphabet [10S02]
a. Q
b.
c.
d.
87. In moore machine shows _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [10S03]
a. states
b. input alphabet
c. output
da.l pFhinaabl esttate
Figure(a)
On input 1010 ouput sequence is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [10S04]
a. 1221
b. 0122
c. 0121
d. 01221
89. A melay machine is a _ _ _ _ _ _ _ _ _ _ tuple. [10S05]
a. 4
b. 5
c. 7
d. 6
90. In case of regular sets the question ' is the intersection of two languages a language of the
same type ?' is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11D01]
a. Decidable
b. Un decidable
c. trivially
dd.e Cciadna'tb slaey
91. In case of regular sets the question 'is the complement of a language also a language of the
same type ? ' is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11D02]
a. Decidable
b. Un decidable
c. trivially



WWW.UandiSTAR.ORG
92. In case of regular sets the question ' is L1 n L2 = F ? ' is _ _ _ _ _ _ _ _ _ _ _ _ [11M01]
a. Decidable
b. Un decidable
c. trivially decidable
d. Can't say
93. In case of regular sets the question ' is L=R where R is a given regular set ?' is _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ [11M02]
a. Decidable
b. Un decidable
d. Can't say
94. In case of regular sets the question ' is L regular ? ' is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11M03]
a. Decidable
b. Un decidable
c. trivially
95. In case of regular sets the question 'Is w in L? 'is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[11S01]
a. Decidable
b. Un decidable
d. Can't say
96. In case of regular sets the question 'is L = F ? 'is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11S02]
a. Decidable
b. Un decidable
d. Can't say
97. In case of regular sets the question 'is L = *? is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11S03]
a. Decidable
b. Un decidable
d. Can't say
98. In case of regular sets the question ' is L1 = L2 ? ' is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [11S04]
a. Decidable
b. Un decidable
d. Can't say
99. In case of regular sets the question 'is L1subset or equal to L2? ' is _ _ _ _ _ _ [11S05]
a. Decidable
b. Un decidable
d. Can't say
100. _ _ _ _ _ _ _ _ _ _ is a regular expression and denotes the empty set. [12D01]
a. e
b.
F c.
d.
101. e is a regular expression and denotes the set _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [12D02]
a.
b.
c.
d.
102. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ denotes any number of 0's followed by any number of 1's
followed by any number of 2's.
a[.12M01]
b.
c. 2* 1* 0*
d. 0* 1* 2*
103. 0 0* 1 1*2 2* = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [12M02]
a.



WWW.UandiSTAR.ORG
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*



WWW.UandiSTAR.ORG
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*
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ [14S02]



WWW.UandiSTAR.ORG
a. e
b. Ø
c. a
d. b
Figure(a)
For the above NFA regular expression is _ _ _ _ _ _ _ _ _ _ _ [14S03]
a. e
b. Ø
c. a
d. b
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



WWW.UandiSTAR.ORG
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. * -
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.



WWW.UandiSTAR.ORG
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
c. regular or not regular
d. can`t say
152. Let L1 =(a+b) * a L2 *
=b(a+b)
L1 intersection L2 = _ _ _ _ _ _ _ _ _ _ [17M01]
a. (a+b) * ab
b. ab ( a+b) *
c. a ( a+b) * b
d.
b( a+b)
*a
153. Let L denote the language generated by the grammar S0s0100 then [17M02]
a. L= 0 +
b. L is CFL but not regular
c. L is regular but not 0 +
d. L is not context free
154. Let A = {0,1 } L= A * Let R = { 0 n1n , n >0 } then LUR _ _ _ _ _ _ _ _ _ _ _ [17M03]
a. regular
b. not regular
c. regular or not regular
d. can`t say
155. Which of the following are regular ? [17S01]
a. string of 0`s whose length is a perfect square
b. set of all palindromes made up of 0`s and 1`s
c. strings of 0`s whose length is prime number
d. string of odd number of
zeros
156. Pumping lemma is generally used for proving [17S02]
a. a given grmmar is regular
b. a given grammar is not regular
c. whether two given regular expressions are equivalent are not
d. a given grammar is CFG
157. Pick the correct statement The logic of pumping lemma is a good example of [17S03]
a. the pigeon hole principle
b. divide and conquer
c. recursion
d. iteration
158. The logic of pumping lemma is a good example of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [17S04]
a. iteration
b. recursion
c. divide and conquer
d. the pigeon hole principle
159. Which sentence can be generated by [17S05]
a. bccddd
b. abbbd
c.



WWW.UandiSTAR.ORG
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]
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



WWW.UandiSTAR.ORG
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
e then n is a leaf node and the father of n has _ _ _ _ _ _ _ Sons. [19M03]
a. 1
b. 2
c. 3
d. 4
173. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if Every vertex has a
label which is a symbol of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [19S01]
a. V
b. T
c. V U T
d. V U T
U{ }
174. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if The label of the root is
_ _ _ _ _ _ _ _ _ _ _ _ _ [19S02]
a. S
b. belongs toV
c. belongs to T
d. belongs toV or belongs to T
175. LetG=(V,T,P,S) be a CFG. A tree is a derivation (or parse) tree for G if If a vertex is
interior and has label A then A must be in _ _ _ [19S03]
a. V
b. T
c. must be S
d. T or V
176. Consider the following derivation tree as shown in figure (a) .The yield is _ _ _ _ _ _ _ _ _
Figure(a)
[19S04]
a. Sba
b. abab
c.
da.b bbaa
177. Consider the following derivation tree as shwon in figure (a)
Figure(a)
Now the yield of A-tree is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [19S05]
a. aAa
b. ab
c.
da.b bbaa
178. Choose the correct statement [20D01]
a. All languages can be generated by CFG
b. Any regular language has an equivalent
Cc.F SGome non regular languages can be generated by CFG
d. Some regular languages can't be simulated by an FSM
179. The intersection of a CFL and a regular language [20M01]



WWW.UandiSTAR.ORG
a. need not be regular
b. need not be context free
c. is always regular
d. can't say
180. Consider the grammar
S
Px
Qy
To get a string of n terminals the number of productions to be used is [20M02]
a. n
b. n+1
c. 2n
d. 2n-1
181. Any string of terminals that can be generated by the following CFG is
S XY
X_
Y_
[20M03]
a. has atleast one b
b. should end in a 'a'
c. has no consecutive a's or b's
d. has atleast two a's
182. The vernacular language English ,if considered a formal language is a [20S01]
a. regular language
b. context free language
c. context sensitive language
d. can`t say
183. The language constructs which are most useful in describing nested structures such as
balanced parentheses matching begin ends etc are _ _ _ _ _ _ _ _ [20S02]
a. RE
b.
CFG
c. NM CFG
d. CSG
184. CFL are closed under [20S03]
a. Union, intersection
b. kleene closure
c. Intersection, complement
d. complement, kleene closure
185. S is equivalent to _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ [20S04]
a. (a-b)
b. (a+b)
c. (a+b) (a+b)
d. a+b or (a+b)
(a+b)
186. The set can be generated by the CFG [20S05]
a. S
b. S
c. S
d. S ab



Flat [ www.uandi star.org]

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (12)

Mehr von Rajesh Yaramadi

Mehr von Rajesh Yaramadi (8)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

Flat [ www.uandi star.org]