Escolar Documentos
Profissional Documentos
Cultura Documentos
(00)* 0(00)*
1 2
00(00)*+0(00)* 3 0* 4 5
Set of all 0s Set of all even number of 0s Set of all odd number of 0s Set of all 0s excluding Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
(iv) A->2,B->3,C->4,D->1
Q2. A
(00)*(11)*
0(00)*(11)*
00(00)*+0(00)* 3
0*
4 5
Set of all strings over {0,1} not containing a 1 Set of all even number of 0s followed by an even number of 1s Set of all odd number of 0s followed by an evn number of 1s Set of all 0s excluding Set of all 0s which are multiples of three and four Set of all 0s
Answer: (i) (ii) (iii) (iv) Q3. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
(0+10)*(+1)
0(00)*
00(00)*+0(00)* 3
Set of all strings over {0,1} not containing two consecutive 0s Set of all strings over {0,1} not containing two consecutive 1s Set of all odd
(1+01)*(+0)
4 5
number of 0s Set of all 0s excluding Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Answer: (i) (ii) (iii) (iv) Q4. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
(0+10)*(+1)
(0+10+110)*(+1+11) 2
(1+01+001)*(+0+00) 3
(1+01)*(+0)
consecutive 0s Set of all strings over {0,1} not containing two consecutive 1s Set of all strings over {0,1} not containing three consecutive 1s. Set of all strings over{0,1} not containing three consecutive 0s. Set of all 0s which are multiples of three and four Set of all 0s which are
multiples of three
Q5. A (0+10)*(+1)
(0+10+110)*(+1+11)
[00+11+(01+10)(00+11)*(01+10)]* 3
Set of all strings over {0,1} not containing two consecutive 0s Set of all strings over {0,1} not containing two consecutive 1s Set of all strings over
(1+01)*(+0)
{0,1} not containing three consecutive 1s. Set of all strings over {0,1} containing an even number of 0s and an even number of 1s. Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Answer:
Q6. A (11+0)*(00+1)*
(0+10+110)*(+1+11)
[00+11+(01+10)(00+11)*(01+10)]* 3
Set of all strings over {0,1} not containing two consecutive 0s Set of all strings over {0,1}where in some head of the string the 1s occur in consecutive pairs and in the tail of the string the 0s occur in consecutive pairs Set of all
(1+01)*(+0)
strings over {0,1} not containing three consecutive 1s. Set of all strings over {0,1} containing an even number of 0s and an even number of 1s. Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Q7. A (11+0)*(00+1)*
1 Set of all strings over {0,1} not containing two consecutive 0s B (01+10)* 2 Set of all strings over {0,1}where in some head of the string the 1s occur in consecutive pairs and in the tail of the string the 0s occur in consecutive pairs C [00+11+(01+10)(00+11)*(01+10)]* 3 Set of all strings over {0,1}containing an equal
D (1+01)*(+0)
number of 0s and 1s where every prefix has at most one more 0 than 1s or at most one more 1 than 0s. 4 Set of all strings over {0,1} containing an even number of 0s and an even number of 1s. 5 Set of all 0s which are multiples of three and four 6 Set of all 0s which are multiples of three
1 Set of all strings over {0,1} ending in 00. B (01+10)* 2 Set of all strings over {0,1}where in some head of the string the 1s occur in consecutive pairs and in the tail of the string the 0s occur in consecutive pairs C [00+11+(01+10)(00+11)*(01+10)]* 3 Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most
D (0+1)*00
one more 0 than 1s or at most one more 1 than 0s. 4 Set of all strings over {0,1} containing an even number of 0s and an even number of 1s. 5 Set of all 0s which are multiples of three and four 6 Set of all 0s which are multiples of three
Q9. A
(11+0)*(00+1)*
(01+10)*
(0+1)*000(0+1)* 3
Set of all strings over {0,1} not containing two consecutive 0s Set of all strings over {0,1}where in some head of the string the 1s occur in consecutive pairs and in the tail of the string the 0s occur in consecutive pairs Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most one more 0
(1+01)*(+0)
than 1s or at most one more 1 than 0s. Set of all strings over {0,1} containing three consecutive 0s. Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Answer: (i) (ii) (iii) (iv) Q10. A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
(11+0)*(00+1)*
(01+10)*
(0+1)*000(0+1)* 3
Set of all strings over {0,1} where every pair of consecutive 0s occurs before any pair of adjacent 1s. Set of all strings over {0,1}where in some head of the string the 1s occur in consecutive pairs and in the tail of the string the 0s occur in consecutive pairs Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most one more 0 than 1s or at
(0+10)*(1+10)*
most one more 1 than 0s. Set of all strings over {0,1} containing three consecutive 0s. Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Q11. A L=(0+1)*00(0+1)*00(0+1)* 1
Set of all
(01+10)*
(0+1)*000(0+1)*
(0+10)*(1+10)*
strings over {0,1} where every pair of consecutive 0s occurs before any pair of adjacent 1s. Set of all strings over {0,1}containing at most one pair of consecutive 0s and at most one pair of consecutive 1s. Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most one more 0 than 1s or at most one more 1 than 0s. Set of all strings over
{0,1} containing three consecutive 0s. Set of all 0s which are multiples of three and four Set of all 0s which are multiples of three
Q12. A
0*(10*)*
Set of all strings over {0,1} where every pair of consecutive 0s occurs before any
B C
(0+10)*(1+10)*
4 5 6
pair of adjacent 1s. 1*(01*)* Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most one more 0 than 1s or at most one more 1 than 0s. (1+01+001)*(+0+00) Set of all 0s which are multiples of three and four (000)*
Q13. A
0*(10*)*
(Ra)* R
B C
1*(01*)* Set of all strings over {0,1}containing an equal number of 0s and 1s where every prefix has at most one more 0 than 1s or at most one more 1 than 0s. (1+01+001)*(+0+00)
Answer: (i) (ii) (iii) (iv) Q14. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
0*(10*)*
(Ra)* R
B C D
(r*s*)**** 2 The complement 3 of (0+1)*000(0+1)* R (aR)* where a 4 and R are some regular expressions 5 6
Q15. A B C D
1 2 3 4
where a and R are some regular expressions 5 Set of all 0s which are multiples of three and four (000)*
Q16. A B C D
1 2 3 4
expressions 5 Set of all 0s which are multiples of three and four (000)*
Answer: (i) (ii) (iii) (iv) Q17. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
(R*+S*)*RR (R+R+R+R)R (+R)* R (aR)* where a and R are some regular expressions
1 2 3 4
(Ra)* R (R+S)*RR RR R
Q18. A B C D
R(S+T) (R+R+R+R)R (+R)* R (aR)* where a and R are some regular expressions
1 2 3 4
(Ra)* R (RS+RT) RR R
(000)*
Answer: (i) (ii) (iii) (iv) Q19. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
1 2 3 4 5
RT+ST RS+RT R RR Set of all 0s which are multiples of three and four (000)*
1 2 3 4 5
RT+ST RS+RT R S+R Set of all 0s which are multiples of three and four (000)*
Answer: (i) (ii) (iii) (iv) Q21. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
R(S+T)T
RT+ST
B C D
2 3 4 5
RST+RTT (R+S)+T S+R Set of all 0s which are multiples of three and four (000)*
Answer: (i) (ii) (iii) (iv) Q22. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
1 2 3 4 5
RT+ST RST+RTT (R+S)+T S+R Set of all 0s which are multiples of three and
four (000)*
Answer: (i) (ii) (iii) (iv) Q23. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
1 2 3 4 5
RT+ST RST+RTT (R+S)+T (RS)T Set of all 0s which are multiples of three and four (000)*
Answer:
*
(R+S)+T (RS)T (R+S)T
1 2 3 4 5
RT+ST
(R+S)+T (RS)T Set of all 0s which are multiples of three and four (000)*
Answer: (i) (ii) (iii) (iv) Q25. A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
A B C D
*
(R+S)+T (RS)T *
1 2 3 4 5
(R+S)+T (RS)T Set of all 0s which are multiples of three and four (000)*
Answer: (i) (ii) (iii) (iv) Q26. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
*
(R+S)+T R(ST) *
1 2 3 4 5
(R+S)+T (RS)T Set of all 0s which are multiples of
Answer: (i) (ii) (iii) (iv) Q27. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
*
(R+S)+T (00)*(1+01) *
1 2 3 4 5
(R+S)+T 0*1 Set of all 0s which are multiples of three and four (000)*
Q28. A * 1 B ((0+1)(0+1)(0+1))*+((0+1)(0+1)(0+1)(0+1))* 2 C (RS)T 3 Set of all strings over {0,1} which are multiples of three or four D * 4 (RS)T 5 Set of all 0s which are multiples of three and four 6 Set of all strings
Q29. A * 1 B ((0+1)(0+1)(0+1))*+((0+1)(0+1)(0+1)(0+1))* 2 3 Set of all C a strings over {0,1} which are multiples Consider the set accepted by the finite of three automata or four
4 +a
Consider the set accepted by the finite automata 5 Set of all 0s which are multiples of three and four 6 Set of all strings over {0,1} which are multiples of three and four
Answer:
Consider the set accepted by the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)=q Consider the set accepted by the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)= Consider the set accepted by the finite automata, M=({q},{0,1},,{q}) (q,0)=,(q,1)=q (Consider the set accepted by the finite automata, M=({q},{0,1},,{q}) (q,0)=(q,1)=
(0+1)*(0+1)*
0*0*0*
1*1*1*
Q31. A
Consider the set accepted 1 by the finite automata, M=({a,b,c},{0,1},,{q}) (a,0)=a,(a.1)=b,(b,1)=b, (b,0)=c,(c,0)=c,(c,1)=c Consider the set accepted 2 by the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)= Consider the set accepted 3 by the finite automata, M=({q},{0,1},,{q})
0*0*1*1*
0*0*0*
(q,0)=,(q,1)=q
D (Consider the set accepted by the finite automata, M=({q},{0,1},,{q}) (q,0)=(q,1)= 4 1*1*1*
Answer: (i) (ii) (iii) (iv) Q32. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Consider the set accepted by 1 the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)=q Consider the set accepted by 2
(01+10)*
(0+1)*(0+1)*
the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)= Consider the set accepted by 3 the finite automata, M=({q},{0,1},,{q}) (q,0)=,(q,1)=q Consider the set accepted by 4 the finite automata, M=({q0,q1,q2,q3},{0,1},,{q}) (q0,0)=q1,(q0,1)=q2, (q1,1)=q0,(q1,0)=q3, (q2,0)=q0,(q2,1)=q3, (q3,0)=q3,(q3,1)=q3 5
0*0*0*
1*1*1*
Q33. A
Consider the set accepted by 2 the finite automata, M=({q},{0,1},,{q}) (q,0)=q,(q,1)= Consider the set accepted by 3 the finite automata, M=({q},{0,1},,{q}) (q,0)=,(q,1)=q Consider the set accepted by 4 the finite automata,
Set of all strings over {0,1} with an equal number of 0s and 1s where every prefix has at most one more 0 than 1 or at most one more 1 than a 0. The set of all strings over {0,1} The set of all 0s
M=({q0,q1,q2,q3},{0,1},,{q}) (q0,0)=q1,(q0,1)=q2, (q1,1)=q0,(q1,0)=q3, (q2,0)=q0,(q2,1)=q3, (q3,0)=q3,(q3,1)=q3 5 Set of all 0s which are multiples of three and four (000)*
Answer: (i) A 1,B->2,C->3,D->4 (ii) A->2,B->3,C->4,D->5 (iii) A->3,B-4,C->5,D->6 (iv) A->2,B->3,C->4,D->1 Q34. A
Consider the set accepted by 3 the finite automata, M=({q},{0,1},,{q}) (q,0)=,(q,1)=q Consider the set accepted by 4 the finite automata, M=({q0,q1,q2,q3},{0,1},,{q}) (q0,0)=q1,(q0,1)=q2, (q1,1)=q0,(q1,0)=q3, (q2,0)=q0,(q2,1)=q3, (q3,0)=q3,(q3,1)=q3
number of 0s and 1s where every prefix has at most one more 0 than 1 or at most one more 1 than a 0. The minimal finite automata has three states The minimal finite automata has 5 states The set of all 1s
Answer: (i) (ii) (iii) (iv) Q35. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The minimal finite automata has four states The minimal finite automata has three
Consider the set accepted by 4 the finite automata, M=({q0,q1,q2,q3},{0,1},,{q}) (q0,0)=q1,(q0,1)=q2, (q1,1)=q0,(q1,0)=q3, (q2,0)=q0,(q2,1)=q3, (q3,0)=q3,(q3,1)=q3 5
states The minimal finite automata has 5 states The minimal finite automata has two states Set of all 0s which are multiples of three and four (000)*
Consider the set accepted by 4 the finite automata, M=({q0,q1,q2,q3},{0,1},,{q}) (q0,0)=q1,(q0,1)=q2, (q1,1)=q0,(q1,0)=q3, (q2,0)=q0,(q2,1)=q3, (q3,0)=q3,(q3,1)=q3 5
The minimal finite automata has four states The minimal finite automata has 8 states The minimal finite automata has 5 states The minimal finite automata has two states Set of all
Answer: (i) (ii) (iii) (iv) Q37. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Consider the 1 regular set the set of all strings over {0,1} not containing 1 as a substring Consider the 2 regular set the set of all strings over
{0,1} not containing 11 as a substring Consider the 3 regular set the set of all strings over {0,1} not containing 111as a substring Consider the 4 regular set the set of all strings over {0,1} not containing 1111 as a substring 5
Answer:
Consider the 1 regular set the set of all strings over {0,1} not containing 101 as a substring Consider the 2 regular set the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 Consider the 3 regular set the set of all
strings over {0,1} where the 10th symbol from the right end is a 1 Consider the 4 regular set the set of all strings over {0,1} ending in 00 5
has 7 states
The minimal finite automata has 1024 states Tshe minimal finite automata has 1000 states No minimal finite automata exists
Consider the 1 regular set the set of all strings over {0,1} where the 1s are divisible by 10 and the 0s are divisible by 11 Consider the 2 regular set the set of all strings over {0,1} where the 0ss are divisible the 3 and the 1s by 2 Consider the 3 regular set the set of all strings over {0,1} where the 0s are divisible by 6
and the 1s divisible by 8 Consider the 4 regular set the set of all strings over {0,1} not containing 1111 as a substring 5
The minimal finite automata has 89 states The minimal finite automata has 890 states
Q40. A
1 Consider a deterministic finite automata with input alphabet {0,1} of 10^1000 states which has no final state 2 Consider a deterministic finite automata with input alphabet {0,1} of 10^1000 states where all the states are final states Consider a 3 deterministic finite automata over the alphabet {0,1} of
(0+1)* is accepted
10^1000 states where the start state is the final state 4 Consider a deterministic finite automata of 10^1000 states over the alphabet {0,1} where the start state is not a final state 5 6
0 is accepted 1 is accepted
Answer: (i) (ii) (iii) (iv) Q41. A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Consider a nondeterministic finite automata with input alphabet {0,1} of 10^1000 states which has no final state Consider a nondeterministic finite automata with input alphabet {0,1} of 10^1000 states where all the states are final states Consider a nondeterministic finite automata over the alphabet {0,1} of 10^1000 states where the start state is the final state Consider a nondeterministic finite automata of 10^1000 states over the
(0+1)* is accepted
alphabet {0,1} where the start state is not a final state 5 6 0 is accepted 1 is accepted
Answer: (i) (ii) (iii) (iv) Q42. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Deterministic finite automata Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
1 2 3 4 5
r.e. sets Regular sets Deterministic context free languages Context sensititve lanaugages Context free
Q43. A B C D
Nondeterministic finite automata push down automata Nondeterministic linear bounded auotmata Nondeterministic turing machines
1 2 3 4 5 6
r.e. sets Regular sets context free languages Context sensitive lanaugages Deterministic context free languageslanguages Recursive sets
Answer: (i) (ii) (iii) (iv) Q44. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Two way deterministic finite automata Deterministic push down automata Nondeterministic linear bounded auotmata Multitape turing machines
1 2 3 4 5 6
r.e. sets Regular sets Deterministic context free languages Context sensitive lanaugages Context free languages Recursive sets
Answer: (i) (ii) (iii) (iv) Q45. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Two way nondeterministic finite automata Deterministic push down automata Nondeterministic linear bounded auotmata Multiheaded turing machines
1 2 3 4 5 6
r.e. sets Regular sets Deterministic context free languages Context sensitive lanaugages Context free languages Recursive sets
Answer: (i) (ii) (iii) (iv) Q46. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Halting 100 pushdown tape machines Deterministic push down automata Nondeterministic linear bounded auotmata 10000 counter machines
1 2 3 4 5 6
r.e. sets Recursive sets Deterministic context free languages Context sensitive lanaugages Context free languages Regular sets
Q47. A B C D
Turing machines that have no ink Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
1 2 3 4 5 6
r.e. sets Regular sets Deterministic context free languages Context sensitive lanaugages Context free languages Recursive sets
Answer: (i) (ii) (iii) (iv) Q48. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Linear bounded automata that have no ink Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
1 2 3 4 5 6
r.e. sets Regular sets Deterministic context free languages Context sensitive lanaugages Context free languages Recursive sets
Answer: (i) (ii) (iii) (iv) Q49. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
B C D
Push down automata where the stack cannot grow more than some N symbols, N fixed Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
r.e. sets
2 3 4 5 6
Regular sets Deterministic context free languages Context sensitive lanaugages Context free languages Recursive
sets
Answer: (i) (ii) (iii) (iv) Q50. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
B C D
Multidimensional, multitape, multiheaded turing machines with 1098 push down tapes but no ink Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
r.e. sets
2 3 4 5
Regular sets Deterministic context free languages Context sensitive lanaugages Context free
Answer: (i) (ii) (iii) (iv) Q51. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Deterministic finite automata Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic halting turing machines
1 2 3 4 5 6
Recursive sets Regular sets Deterministic context free languages Context sensititve lanaugages Context free languages R.e. sets
Answer: (i) (ii) (iii) (iv) Q52. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
1 2 3 4 5 6
r.e. sets Regular sets Deterministic context free languages Context sensititve lanaugages Context free languages Recursive sets
Answer: (i) (ii) (iii) (iv) Q53. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
Deterministic finite automata Deterministic push down automata Nondeterministic linear bounded auotmata Deterministic turing machines
1 2 3 4 5 6
Type 0 languages Type 3 languages Deterministic context free languages Type 1 languages Type 2 languages Recursive sets
Deterministic 1 finite automata Deterministic 2 push down automata Halting two 3 pushdown tape machines Deterministic 4 turing machines 5 6
B C
Proceduresthat are not necessarily algorithms Regular sets Deterministic context free languages Algorithms Context free languages Recursive sets
The set of all strings over {0,1} with any number of 0s and any number of 1s The set of all strings over {0,1} with an equal number of 0s and 1s The set of all strings over {0,1,2} with an equal number of 0s, 1s and 2s. The set of regular expressions whose complement is empty
Context sensititve language that is not context free r.e but not
Answer: (i) (ii) (iii) (iv) Q56. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
B C
The set of all 1 strings over {0,1} with any number of 0s and any number of 1s The set of all 2 palidromes over {0,1} The set of all 3 strings over {0,1,2} with an equal number of 0s, 1s and
Context sensititve language that is not context free r.e but not recursive Finite set
5 6
Answer: (i) A 1,B->2,C->3,D->4 (ii) A->2,B->3,C->4,D->5 (iii) A->3,B-4,C->5,D->6 (iv) A->2,B->3,C->4,D->1 Q57. A
The set of all 1 strings over {0,1} with any number of 0s and any number of 1s The set of all 2
Recursive set
Regular set
strings over {0,1} with an equal number of 0s and 1s The set of all 3 strings over {0,1,2}of the form ww where w is a string in {0,1,2}+ 4 The set of regular expressions whose complement is empty 5 6
Context sensititve language that is not context free r.e but not recursive Finite set
Q58. A
The set of all strings over {0,1} with any number of 0s and any number of 1s The set of all strings over {0,1} not of the form ww, w in {0,1}+ The set of all strings over {0,1,2} with an equal number of 0s, 1s and 2s. The set of regular expressions whose intersection is empty
Recursive set
Context sensititve language that is not context free r.e but not recursive Finite set
5 6
Answer: (i) (ii) (iii) (iv) Q59. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all 1 strings over {0,1} with any number of 0s and any number of 1s The set of all 2 strings over {0,1} with an unequal number of 0s and 1s The set of all 3 strings over {0,1,2} with an equal number of
Recursive set
0s, 1s and 2s. The set of regular expressions whose complement is empty
Context sensititve language that is not context free r.e but not recursive Finite set
5 6
Answer: (i) (ii) (iii) (iv) Q61. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all 1 strings over {0,1} not containing three consecutive 0s and not
Recursive set
containing three consecutive 1s. The set of all 2 strings over {0,1,2} with an unequal number of 0s and 1s or an unequal number of 1s and 2s The set of all 3 strings primes in unary. 4 The set of regular expressions whose complement is empty 5 6
context free language Context sensititve language that is not context free r.e but not recursive Finite set
Q62. A B
The set of all powers of 2 in binary The set of all strings palidromes over a finite alphabet The set of all strings primes in unary. The set of regular expressions whose complement is empty
1 2
context free language Context sensititve language that is not context free r.e but not recursive
Finite set
Answer: (i) (ii) (iii) (iv) Q63. A B A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all powers of 2 in binary The set of all strings with an equal number of 0s and 1s or with twice as many 0s as 1s. The set of all strings that are not primes in binary. The set of
1 2
Context
sensititve language that is not context free r.e but not recursive Finite set
Answer: (i) A 1,B->2,C->3,D->4 (ii) A->2,B->3,C->4,D->5 (iii) A->3,B-4,C->5,D->6 (iv) A->2,B->3,C->4,D->1 Q64. A B C D
The set of all powers of 1 20 in base 20 {0^m1^n0^(m+n)|m,n>1} 2 The set of all strings primes in unary. The set of regular expressions whose 3 4
Recursive set Regular set but not a dcfl context free language Context sensititve
complement is empty 5 6
language that is not context free r.e but not recursive Finite set
Answer: (i) (ii) (iii) (iv) Q65. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all powers of 1 20 in base 20 {0^m1^n0^(m+n)|m,n>1} 2 {wwRw|w in {0,1}+} The set of regular expressions whose complement is empty 3 4
Recursive set Regular set but not a dcfl context free language Context sensititve language that is not
5 6
Answer: (i) (ii) (iii) (iv) Q66. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all powers of 1 20 in base 20 {0^m1^n0^(m+n)|m,n>1} 2 {a^nb^n^2|n>1} The set of regular expressions whose complement is empty 3 4
Recursive set Regular set but not a dcfl context free language Context sensititve language that is not context free r.e but not
Answer: (i) (ii) (iii) (iv) Q67. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all powers of 1 20 in base 20 {0^m1^n0^(m+n)|m,n>1} 2 {a^Ib^j|gcd(I,j)=1} The set of regular expressions whose complement is empty 3 4
5 6
Recursive set Regular set but not a dcfl context free language Context sensititve language that is not context free r.e but not recursive Finite set
Answer: (i) (ii) (iii) (iv) Q68. A B C D A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
The set of all powers of 1 200 in base 200 {0^m1^n0^(m+n)|m,n>1} 2 {a^Ib^jc^k|I not equal to 3 j not equal to k} The set of regular expressions whose complement is empty 4
5 6
Recursive set Regular set but not a dcfl context free language Context sensititve language that is not context free r.e but not recursive Finite set
Answer: (i) (ii) (iii) (iv) Q69. A A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1
B C D
The set of all strings ovesr 1 {0,1} not containing 0000000001111111100000 as a substring {0^m1^n0^(m+n)|m,n>1} 2 {a^Ib^jc^k|I not equal to j 3 not equal to k} {0^n1^n| n<20 lakh} 4
Finite set
5 6
Regular set but not a dcfl context free language Context sensititve language that is not context free r.e but not recursive Recursive
Answer: (i) (ii) (iii) (iv) Q70. A B C A 1,B->2,C->3,D->4 A->2,B->3,C->4,D->5 A->3,B-4,C->5,D->6 A->2,B->3,C->4,D->1