THEORY OF COMPUTATION Q1. Choose the correct statement. The set of all strin s o!

er an al"ha#et $ %&'(1) *ith the concatenation o"erator for strin s a) does not form a group b) forms a noncommutative group c) does not have a right identity d) forms a group if the empty string is removed from S *

Q2. Consider the set of all strings S * over an alphabet S ={a,b} with the concatenation operator for strings, and a) the set does forms semigroup b) the set does not form a group c) the set has a left and right identity d) the set forms a monoid

Q3. Consider the set of all strings S * over the alphabet S ={a,b,c,d,e} with the concatenation operator for strings. a. the set has a right identity and forms a semigroup b. the set has a left identity and forms a monoid c. the set does not form a commutative group but has an identity d. the set does not form a semigroup with identity

Q4. obod! "nows !et if # = #. Consider the lang$age % defined as follows& %='()*(* if # = #

+nd %=, otherwise -hich of the following state.ents is tr$e/ a) L is recursive b) L is recursively enumerable but not recursive c) L is not recursively enumerable d) Whether L is recursive or not will be known after we find out if P = NP

Q0. Consider the lang$age defined as follows %= {a1n b1n2n3=*} if #= # +nd %={ww2w in 'a)b()} otherwise -hich of the following state.ents is tr$e/ a) L is recursive but not context sensitive b) L is context sensitive but not context free c) L is context sensitive d) What L is will be known after we resolve the P=NP uestion

Q4. Consider the lang$age defined as follows %='5)*(* if the CS%s are closed $nder co.ple.ent +nd %='5**(*5* if #= # +nd

%='*5*(** if # is not the sa.e as # -hich of the following state.ents is tr$e/ a) L is always a regular set b) L does not exist c) L is recursive but not a regular set d) What L is will be known after the two open problems P = NP and the closure of !"Ls under complement are resolved

Q6. Consider the lang$age defined as follows %='5)*(* if .an goes to 7ars b! 2525+8 +nd %=5* if .an never goes to the 7ars -hich of the following is tr$e/ a. L is context free language but not recursive b. L is recursive c. Whether L is recursive or not will be known in #$#$%& d. L is a r.e. set that is not regular Q9. :iven an arbitrar! conte;t free gra..ar :, we define % as below. %='5)*(* if : is a.big$o$s +nd %=, if : is not a.big$o$s

a. L is a context'free language

b. L is recursive but not r.e. c. What L is depends on whether we can determine if ( is ambiguous or not d. What L is is undecidable

Q<. :iven an arbitrar! t$ring .achine 7 and a string w we define % as below. %='5**(*5* if 7 halts on w +nd %='5***(* if 7 does not halt on w

a. )he type of L is undecidable because of the halting problem b. L is a context'sensitive language c. L is recursively enumerable and not context'free d. L is context sensitive and not regular

Q*5. Consider the lang$age % defined below %='5)*(* if #= # +nd %='a1nb1n2n3=*} otherwise

a. Whether L is a regular set that is not context'free will be known after we resolve the P=NP uestion. b. Whether L is context'free but not regular will be known after we resolve the P=NP uestion c. L is context'sensitive d. L is not recursive

Q**. =t is $ndecidable if two cfls %* and %2 are e>$ivalent. Consider two cfls %* and %2 and a lang$age defined as follows %={a1nb1nc1n2n3=234} if %*=%2 +nd %={a1nb1nc1nd1n2n3=469} otherwise

a. L is recursive b. L is context'free c. We can never say anything about L as it is undecidable d. L is regular Q*2. +t present it is not "nown if # is closed $nder co.ple.entation. Consider % defined as below %={w w? w2 w in '5)*)2(* and w? is the reverse of w} if # is closed $nder co.ple.ent +nd % = {a1nb1nc1nd1ne1n2n3=34046} otherwise

a) L is recursive b) L is context'free and not context'sensitive c) L is recursively enumerable but not recursive d) We will be able to say something about L only after we resolve the NP complementation issue Q*4. obod! "nows if #= # at present. Consider a lang$age % as defined below %='5)*(* if satisfiabilit! is in # %='5**(5* if satisfiabilit! is not in #

%='**5(** if 3@sat is in # %='5***(* if 3@sat is not in # %='5***5***(* if 5A* "napsac" proble. is in # %='**5***5*(* if 5A* "napsac" proble. is not in # %='5*'55(*'*****(*( * if .a;@cli>$e proble. is in # %='5*'55(*'*****(*( * if node@cover proble. is not in # %='5***(****'5*5(* if edge@cover proble. is not in # %='5* ) ** ) '55(* ) '**(*(*'5*55*5*5*5(* if the chro.atic proble. is not in # -hat can we sa! abo$t the string 5555****5555****=; a) x is always in L b) whether x is in L or not will be known after we resolve P=NP c) the definition of L is contradictory d) x can never be in L Q*0. +n arbitrar! t$ring .achine 7 will be given to !o$ and we define a lang$age % as follows %='5)55(* if 7 accepts at least one string %='5)55)555(* if 7 accepts at least two strings %='5)55)555)5555(* if 7 accepts at least three strings @@@@@@@@@ @@@@@@@@@ %='5)55)555)@@@)51n( *if 7 accepts at least n@* strings Choose the correct state.ent. a) We cannot say anything about L as the uestion of whether a turing machine accepts a string

is undecidable b) L is context'sensitive but not regular c) L is context'free but not regular d) L is not a finite set Q*4. -e are given two conte;t@free lang$ages %* and %2 and % defined as below a( %='5)*(* if %*=%2 b( %=''5)55)555(*'*)**)***(*(* if %* is contained in %2 c( %=''5'*5(*(*'*'5*(*(* if %2 is contained in %* d( %='55)**)5)*(*'5)55)555(* if %* and %2 are inco.parable

a) %s all the conditions relating to L* and L# are undecidable we cannot say anything about L b) L is recursively enumerable c) L is recursive but not context'sensitive d) L is context'sensitive but not context'free e) L is context'free but not regular Q*6. =t is $ndecidable if an arbitrar! cfl is inherentl! a.big$o$s. -e are given a cfg : and the lang$age % is defined as below %= '5)*(*5*'5)*(* B **5* if %':( is inherentl! a.big$o$s %='5)*(**5'5)*(* B 5*** if %':( is not inherentl! a.big$o$s Choose the incorrect state.ent a) L is regular b) L iscontext'free c) L is context'sensitive

d) )he above choices can be resolved only if we know if L+() is inherently ambiguous or not Q*9. -e are given an arbitrar! t$ring .achine 7 and define the lang$age % as below %='5*)**(* if 7 halts on blan" tape %='5)**(* if 7 ever prints a * %='5*)*(* if 7 ever enters a designated state > %=''5)*)55)**)555)***()(* if 7 accepts an infinite set %=5*'*5*(* if 7 accepts a finite set %=**'5**(* if 7 accepts e;actl! 40 strings Choose the correct state.ent with reference to the string ;=55555******555555****** a) x is in L b) x is not in L c) we can never decide if x is in L as all the problems of the turing machine are undecidable d) whether x is in L depends on the particular turing machine , Q*<. -e are given a lang$age % defined as follows %='5)*(* if the Ca.iltonian circ$it proble. is in # %='5***)5(* if the Draveling sales.an proble. is not in # %='5****(*5* if the bin pac"ing proble. is in #

a) the definition of L is contradictory b) What L is will be known after we resolve the P=NP uestion c) L if a finite set d) )he string $*$*$*$*$$*$*$**$$*$*$* is in L Q25. Dhe intersection of two cfls can si.$late a t$ring .achine co.p$tation. -e are

given two cfls %* and %2 and define the lang$age % as below a( %='55(* if the intersection of %* and %2 is e.pt! b( %=''5'55(*('5'55(*((* if %* is reg$lar c( %='55)5555)555555(* if %2 is not reg$lar d( %='55(*)'5555(* if the co.ple.ent of %* is a cfl

a) L is a finite set b) L is a regular set c) L is undecidable d) L is recursive but not context'free

Q2*. obod! "nows at present if #= #. Consider the definition of % below %='a1ib1,c1"2i3,3"} if the s$. of s$bsets proble. is in # %='a1ib1,c1"2i,,," all $ne>$al} if # is not the sa.e as #

a. L is regular and not finite b. We can tell the type of L after resolving the P=NP uestion

c. L is recursive and not context'free d. L is context'free and not context'sensitive Q22. Dhe reg$lar e;pression 5*'*5*(* denotes the sa.e set as a. +$-*)$- b. $ . +$ .*$)- c.-$.*)-*$+$.*)- d. none of the above Q23. Dhe reg$lar e;pression 5*'*5*(* denotes the sa.e set as

a. +*-$)*- b. $ . +$ .*$)- c.-$.*)-*$+$.*)- d. none of the above /(%)0 #$$12 Q22. Dhe reg$lar e;pression 5*'*5*(* denotes the sa.e set as a. +$-*)*- b. $ . +$ .*$)- c.-$.*)-*$+$.*)-.$-*- d. none of the above Q23. Dhe reg$lar e;pression '5)*5(* denotes a. the set of all strings not containing two consecutive $3s b. the set of all strings containing two consecutive $3s c. the set of all strings with an even number of $3s d. none of the above Q24. Dhe reg$lar e;pression 'e )5)55('*)*5)*55(* denotes a. the set of all strings not containing three consecutive $3s b. the set of all strings containing three consecutive $3s c. the set of all strings with an odd number of $3s d. none of the above Q20. Dhe reg$lar e;pression '55)**)'5*)*5('55)**(*'5*)*5((* denotes a. the set of all strings with an even number of $s and an even number $3s and an even number of *3s b. the set of all strings over 4$5*6 c. the set of all strings with the $3s and *3s alternating d. none of the above Q24. =f the strings of a lang$age % can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite

b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free /(%)0 #$$12 Q26. =f the strings of a lang$age % that is accepted b! a t$ring .achine can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q29. =f the strings of a lang$age % that are accepted b! a .$ltidi.ensional t$ring .achine 7 can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q2<. =f the strings of a lang$age % that are accepted b! a 3 pebble .achine 7 can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free

Q35. =f the strings of a lang$age % that are accepted b! a .$ltitrac" t$ring .achine 7 can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q3*. =f the strings of a lang$age % that are accepted b! a nondeter.inisitic, 04 p$shdown tape .achine 7, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q32. =f the strings of a lang$age % that are accepted b! a nondeter.inistic <96 co$nter .achine 7, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q33. =f the strings of a lang$age % that are accepted b! a t$ring .achine with 2@wa! infinite tape, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite

c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q34. =f the strings of a lang$age % that are accepted b! a 4046 headed nondeter.inistic t$ring .achine,can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q30. =f the strings of a lang$age % accepted b! a t$ring .achine, which has *555 two wa! infinite tapes, *555 s!.bols in the tape alphabet, 2555 inp$t s!.bols, l340 di.ensional tapes, 34046 heads, optional 340 p$shdown tapes, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q34. =f the strings of a lang$age % that are accepted b! a .achine which can "eep 455 pebbles an!where on its infinite inp$t tape, b$t has no tape s!.bols, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q36. =f the strings of a lang$age % that are accepted b! a t$ring .achine, with a whose tape alphabet is a singleton set, can be effectivel! en$.erated in le;icographic 'i.e.

alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q39. =f the strings of a lang$age %={E732encoding of t$ring .achine 7}, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q3<. =f the strings of a lang$age % ={E732encoding of 40469 p$sh down tape .achines} can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free Q45. =f the strings of a lang$age %={E732 7 is an encoding of t$ring .achines, p$shdown a$to.ata, linear bo$nded a$to.ata, finite a$to.ata}, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular

d) L is recursive but not necessarily context free

Q4*. =f the strings of a lang$age % ={E732 7 is an encoding of t$ring .achines that have .ore than 340469<5 states}, can be effectivel! en$.erated in le;icographic 'i.e. alphabetic( order, which of the following state.ents is tr$e/ a) L is necessarily finite b) L is regular but not necessarily finite c) L is context free but not necessarily regular d) L is recursive but not necessarily context free

Q42. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aSb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+()

Q43. %et :='{S},{a,b,c},?,S( be a conte;t@free gra..ar where the r$le set is SF aSa2bSb2c. -hich of the following state.ents is tr$e/ a) ( is ambiguous b) )here exist x and y in L+() such that xy is in L+() c) )here exist a deterministic push down automaton that accepts L+()

d) We can find a deterministic finite state automaton that accepts L+() Q44. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aSb2SSSSSSSSSSS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+() Q40. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aSb2aaSbb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+() Q44. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aaSbb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+()

Q46. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aaaSbbb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+() Q49. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF abSba2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+() Q4<. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aaabaaaSbbbabbb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) )here exist a deterministic push down automaton that accepts L+() d) We can find a deterministic finite state automaton that accepts L+() Q05. Choose the correct state.ent for the lang$age %={a1nb1n2n3=5}

a) L is inherently ambiguous b) L is deterministic context'free c) L is regular d) )here exists a deterministic two way finite automata accepting L Q0*. Choose the correct state.ent for the lang$age %={a1*55nb1*55n2n3=5} a) L is inherently ambiguous b) L is deterministic context'free c) L is regular d) )here exists a deterministic two way finite automata accepting L Q02. Choose the correct state.ent for the lang$age %={'aaabaaa(1*555n'bbbbbbb(134046n2n3=5} a) L is inherently ambiguous b) L is deterministic context'free c) L is regular d) )here exists a deterministic two way finite automata accepting L Q03. Choose the correct state.ent for the lang$age %={G'G1n G (G 1n2n3=5} a) L is inherently ambiguous b) L is deterministic context'free c) L is regular d) )here exists a deterministic two way finite automata accepting L Q04. Choose the correct state.ent for the lang$age %={'begin(1n'end(1n2n3=5} a) L is inherently ambiguous

b) L is deterministic context'free c) L is regular d) )here exists a deterministic two way finite automata accepting L Q00. %et :='{S},{a,b},?,S( be a conte;t@free gra..ar where the r$le set is SF aSb2SS2e -hich of the following state.ents is tr$e/ a) ( is not ambiguous b) )here exist x and y in L+() such that xy is not in L+() c) L+() is the set of all strings of balanced parenthesis with a as the opening parenthesis and b as the closing parenthesis. d) We can find a deterministic finite state automaton that accepts L+() Q04. Consider two lang$ages %* and %2 each on the alphabet S . %et f& S @3S be a pol!no.ial ti.e co.p$table bi,ection s$ch that 'H ;(I;e %2J. K$rther, let f1@* be also pol!no.ial ti.e co.p$table. -hich of the following C+ a) L* e P and L# finite b) L*e NP and L#e P c) L* is undecidable and L# is decidable d) L* is recursively enumerable and L# is recursive Q06. Consider two lang$ages %* and %2 each on the alphabet S . %et f& S @3S be a pol!no.ial ti.e co.p$table bi,ection s$ch that 'H ;(I;e %2J. K$rther, let f1@* be also pol!no.ial ti.e co.p$table. -hich of the following C+ a) L* e P and L# finite b) L*e NP and L#e P'"P%!0 LD be tr$e/ LD be tr$e/

c) L* is undecidable and L# is decidable d) L* is recursively enumerable and L# is context'sensitive Q09. Consider two lang$ages %* and %2 each on the alphabet S . %et f& S @3S be a pol!no.ial ti.e co.p$table bi,ection s$ch that 'H ;(I;e %2J. K$rther, let f1@* be also pol!no.ial ti.e co.p$table. -hich of the following C+ a) L* e P and L# regular b) L*e NP and L#e P c) L* is undecidable and L# is decidable d) L* is context'sensitive and L# is recursive Q0<. Consider two lang$ages %* and %2 each on the alphabet S . %et f& S @3S be a pol!no.ial ti.e co.p$table bi,ection s$ch that 'H ;(I;e %2J. K$rther, let f1@* be also pol!no.ial ti.e co.p$table. -hich of the following C+ LD be tr$e/ LD be tr$e/

a) L* e P'"P%!0 and L# e &"P%!0+n7*$$$) b) L*e NP and L#e &)8,0+#7*$$$n) c) L* is undecidable and L# is decidable d) L* is recursively enumerable and L# is accepted by a #P&%

Q45. Consider two lang$ages %* and %2 each on the alphabet S . %et f& S @3S be a pol!no.ial ti.e co.p$table bi,ection s$ch that 'H ;(I;e %2J. K$rther, let f1@* be also pol!no.ial ti.e co.p$table. Which of the following !%NN9) be true: a) L* e P and L# is accepted by a #N;% b) L*e NP and L#is accepted by a linear bounded automata

c) L* is undecidable and L# is decidable d) L* is recursively enumerable and L# is accepted by a turing machine that halts on all inputs

Q9*. %et % be a lang$age accepted b! so.e nondeter.inistic .$ltitape t$ring .achine and %* its co.ple.ent also accepted b! a two p$shdown tape .achine then choose the correct state.ent a) L is recursively enumerable but not necessarily recursive b) L is recursive but L* is not necessarily recursive c) <oth L and L* are recursively enumerable but not necessarily recrsive d) <oth L and L* are recursive

Q92. %et % be a lang$age accepted b! so.e nondeter.inistic .$ltitape t$ring .achine and %* its co.ple.ent also accepted b! a nondeter.inistic two p$shdown tape .achine then choose the correct state.ent a) L is recursively enumerable but not necessarily recursive b) L is recursive but L* is not necessarily recursive c) <oth L and L* are recursively enumerable but not necessarily recursive d) <oth L and L* are recursive Q93. Choose the correct state.ent a) there exists a universal turing machine which can simulate any turing machine , on its input w b) there does not exist a universal turing machine which can simulate any turing machine on its input w c) the set Ld=4=,i5wi>? the encoding ,i of the ith turing machine does not accept the input wi5 in an enumeration of turing machines and input strings6 is recursively enumerable d) the universal language is recursive

Q94. Dhe printing proble. of t$ring .achines is whether a t$ring .achine ever prints a * on its tape. ?a. ta"es the set %={E7,w32 encoding of t$ring .achine 7 that does not accept w} which is "nown to be $ndecidable. Ce .odifies 7 s$ch that in an accepting state no .oves are .ade. Sh!a. f$rther .odifes 7 to 7* so that in an accepting state it prints a * and then halts. Choose the correct state.ent. a) We can conclude that ,* prints a * and halts only if , accepts w5 and thus the printing problem reduces to the problem of L being recursive b) We cannot conclude that the printing problem is undecidable c) We can conclude that the printing problem is recursive but not necessarily recursively enumerable d) None of the above. Q90. Dhe state proble. of t$ring .achines is whether a t$ring .achine ever enters a state >. ?a. ta"es the set %={E7,w32 encoding of t$ring .achine 7 that does not accept w} which is "nown to be $ndecidable. Ce .odifies 7 s$ch that in an accepting state no .oves are .ade. Sh!a. f$rther .odifes 7 to 7* so that in an accepting state it .oves to state > and then halts. Choose the correct state.ent. a) We can conclude that ,* halts only if , accepts w5 and thus the state problem reduces to the problem of L being recursive b) We cannot conclude that the printing problem is undecidable c) We can conclude that the printing problem is recursive but not necessarily recursively enumerable d) None of the above. Q94. Dhe printing proble. of t$ring .achines is whether a t$ring .achine ever prints a *** on its tape. ?a. ta"es the set %={E7,w32 encoding of t$ring .achine 7 that does not accept w} which is "nown to be $ndecidable. Ce .odifies 7 s$ch that in an accepting state no .oves are .ade. Sh!a. f$rther .odifes 7 to 7* so that in an accepting state it prints a *** and then halts. Choose the correct state.ent. a) We can conclude that ,* prints a *** and halts only if , accepts w5 and thus the printing problem reduces to the problem of L being recursive b) We cannot conclude that the printing problem is undecidable c) We can conclude that the printing problem is recursive but not necessarily recursively

enumerable d) None of the above. Q96. Dhe blan" tape halting of t$ring .achines is whether a t$ring .achine started on blan" tape halts. ?a. ta"es the set %={E7,w32 encoding of t$ring .achine 7 that does not accept w} which is "nown to be $ndecidable. Ce .odifies 7 s$ch that in an accepting state no .oves are .ade. Sh!a. f$rther .odifes 7 to 7* so that it starts with a blan" tape and first prints w on the tape and behaves ,$st li"e 7. Choose the correct state.ent. a) We can conclude that ,* halts only if , accepts w5 and thus the printing problem reduces to the problem of L being recursive b) We cannot conclude that the printing problem is undecidable c) We can conclude that the printing problem is recursive but not necessarily recursively enumerable d) None of the above. Q99. Dhe ai. of the following >$estionis to prove that the lang$age {72 7 is the code of a t$ring .achine which, irrespective of the inp$t, halts and o$tp$ts a *, is $ndecidable. Dhis is to be done b! red$cing fro. the lang$age {7M,;27M halts on ;}, which is "nown to be $ndecidable. ?a. proceeds as follows. Ce ta"es the t$ring .achine 7 and .odifies it so that it .a"es no .oves in its final state and then it prints a * in the final state and halts. Sh!a. f$rther .odifies this 7 so that it initiall! ta"es an arbitrar! t$ring .achine 7M and its inp$t ;, and if 7M accepts and halts on ; then 7 will start its operation otherwise not. Dhis he achieves b! having 7 en$.erate t$ring .achines and strings till the encoding for 7M and ; are obtained. Choose the correct state.ent a) the modified , will accept all strings and print a * provided , halts on w5 but we have a decision problem for ,3 then we can resolve whether , halts on w b) ,3 is always recursive and the modified , accepts a recursive language c) )he above argument shows that ,3 is recursively enumerable d) )he above argument shows that ,3 is recursive but not necessarily context sensitive Q9<. Dhe e.ptiness proble. for r.e. sets is whether for an! r.e. set % we can decide if %=,

. +s % is a s$bset of {a} we concl$de that a) L does not satisfy the containment property so L cannot be r.e. b) L is a regular set as 4a6 is regular c) L is recursive always d) L is recursively enumerable Q<5. Dhe co.pleteness proble. for r.e. sets is whether for an! r.e. set % we can decide if %=S *. a) as no finite subset of L can be the same as L we conclude that the set L is not r.e. b) L is r.e. as L is regular c) L is recursively enumerable as we only re uire a turing machine that halts on all inputs d) L is recursive but not necessarily context'free Q<*. Dhe reg$larit! proble. for r.e. sets is whether for an! r.e. set %, is % reg$lar/ a) the regularity problem is decidable b) as the regular sets are contained in the context'free languages if the regularity problem is decidable then by the containment property every cfl must be regular c) every r.e. set is trivially seen to be regular as every turing machine has a finite control d) as every regular set is contained in the set of all strings5 the latter must be in L by the containment property and that is known to be undecidable. Q<2. Dhe conte;t@freeness proble. for r.e. sets is whether for an! r.e. set %, is % conte;t@ free/ a) the context'freeness problem is decidable b) as the regular sets are contained in the context'free languages if the regularity problem is decidable then by the containment property every cfl must be regular c) every r.e. set is trivially seen to be context'free as every turing machine has a finite control d) as every context'free language is contained in the set of all strings5 the latter must be in L by

the containment property and that is known to be undecidable. Q<3. Dhe rec$siveness proble. for r.e. sets is whether for an! r.e. set %, is % rec$rsiver/ a) the recusiveness problem is decidable b) as the regular sets are contained in the recursisve if the regularity problem is decidable then by the containment property every recursive set must be r.e. c) every recursive set is trivially seen to be regular as every turing machine has a finite control d) as every recursive set is contained in the set of all strings5 the latter must be in L by the containment property and that is known to be undecidable. Q<4. %et %5={E7,5327 is the encoding of a t$ring .achine that accepts the e.pt! set} +nd %*={E7,*327 is the encoding of a t$ring .achine that does not accept the e.pt! set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q<0. %et %5={E7,5327 is the encoding of a t$ring .achine that accepts an infinite t! set} +nd %*={E7,*327 is the encoding of a t$ring .achine that does not accept an infinite set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q<4. %et %5={E7,5327 is the encoding of a t$ring .achine that accepts a singleton set} +nd %*={E7,*327 is the encoding of a t$ring .achine that does not accept a singleton set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent

a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q<6. %et %5={E7,7M,5327,7M are the encodings of t$ring .achines that accept the e.pt! set} +nd %*={E7,7M,*327,7M are the encodings of a t$ring .achines that either one or both do not accept the e.pt! set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q<9. %et %5={E7,5327 is the encoding of a t$ring .achine that accepts a cfl} +nd %*={E7,*327 is the encoding of a t$ring .achine that does not accept a cfl}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q<<. %et %5={E:,:M,532:,:M are the encodings of cfgs that generate the sa.e set} +nd %*={E:,:M,*32:,:M are the encodings of cfgs that either one or both do not generate the sa.e set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive

b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*55. %et %5={E:,:M,532:,:M are the encodings of reg$lar gra..ars that generate the sa.e set} +nd %*={E:,:M,*32:,:M are the encodings of reg$lar gra..ars that either one or both do not generate the sa.e set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable

Q*5*. %et %5={E:,:M,532:,:M are the encodings of cfgs that generate infinte lang$ages} +nd %*={E:,:M,*32:,:M are the encodings of cfgs that either one or both do not generate infinite sets}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable

Q*52. %et %5={E:,:M,532:,:M are the encodings of csgs that generate the sa.e set} +nd %*={E:,:M,*32:,:M are the encodings of csgs that either one or both do generate the sa.e set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable

c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*53. %et %5={E:,:M,532:,:M are the encodings of $nrestricted gra..ars that generate the sa.e set} +nd %*={E:,:M,*32:,:M are the encodings of $nrestricted gra..ars that either one or both do generate the sa.e set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*54. %et %5={E:,:M,532:,:M are the encodings of linear bo$nded a$to.ata that generate the sa.e set} +nd %*={E:,:M,*32:,:M are the encodings of linear bo$nded a$to.ata that either one or both do generate the sa.e set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*50. %et %5={E:,:M,532:,:M are the encodings of $nrestricted gra..ars s$ch that the! generate % and %? respectivel! with %=%?} +nd %*={E:,:M,*32:,:M are the encodings of $nrestricted gra..ars that generate lang$ages % and %? with % not the sa.e as %? respectivel!}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable

c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*54. %et %5={E:,:M,532:,:M are the encodings of C progra.s that prod$ce the sa.e o$tp$t for all inp$ts} +nd %*={E:,:M,*32:,:M are the encodings of C progra.s that do not prod$ce the sa.e o$tp$t for all inp$ts}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*56. %et %5={E:,:M,532:,:M are the encodings of C progra.s that prod$ce so.e o$tp$t for all inp$ts} +nd %*={E:,:M,*32:,:M are the encodings of C progra.s that do not prod$ce so.e o$tp$t for all inp$ts}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*59. %et %5={E:,:M,532:,:M are the encodings of C progra.s that loop on so.e inp$t} +nd %*={E:,:M,*32:,:M are the encodings of C progra.s that do not loop on so.e inp$t}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable

c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q*5<. %et %5={E:,:M,532:,:M are the encodings of cfgs where the intersection of the lang$gaes generated is a cfl} +nd %*={E:,:M,*32:,:M are the encodings of cfgs where the intersection of the lang$ages generated is not a cfl}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q**5. %et %5={E:,:M,532:,:M are the encodings of cfgs that generate reg$lar sets} +nd %*={E:,:M,*32:,:M are the encodings of cfs that both or either does not generate a reg$lar set}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q***. %et %5={E:,:M,532:,:M are the encodings of cfgs s$ch that %':M( is contained in %':(} +nd %*={E:,:M,*32:,:M are the encodings of cfgs s$cht that %':M( is not contained in %':(}. %et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive

d) Neither L nor L3 is recursively enumerable Q**2. %et %5={E:,:M,532:,:M are the encodings of cfgs which generate lang$ages whose co.ple.ent is also a cfl} +nd %*={E:,:M,*32:,:M are the encodings of C progra.s that generate lang$ages whose co.ple.ent is not both a cfl}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q**3. %et %5={E:,:M,532:,:M are the encodings of a.big$o$s cfgs} +nd %*={E:,:M,*32:,:M are the encodings of $na.big$o$s cfgs}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q**4. %et %5={E:,:M,532:,:M are the encodings of inherentl! a.big$o$s cflss} +nd %*={E:,:M,*32:,:M are the encodings of cfls that are not inherentl! a.big$o$s}.%et %=%5B%*. %et %M be the co.ple.ent of %. Choose the correct state.ent a)L is recursively enumerable but not recursive and L3 is recursive b) L is recursive and L3 is recursively enumerable c) L is not recursively enumerable and L3 is recursive d) Neither L nor L3 is recursively enumerable Q**0. Choose the false state.ent

a) P!P over a one symbol alphabet is decidable b) 8t is undecidable if a csl is a cfl c) 8t is undecidable if a turing machine accepts at least *$ inputs d) 8t is undecidable if two regular grammars generate the same set

Q**4. 8efine lang$ages %5 and %* as follows& %5={E7,7*,5327 is e>$ivalent to 7*} %*={E7,7*,*32 7 is not e>$ivalent to 7*} Cere E7,w,=3 is a triplet, whose first co.ponent, 7 is an encoding of a t$ring .achine , second co.ponent 7* is the encoding of a nondeter.inistic linear bo$nded a$to.aton, and third co.ponent = is a bit. %et %=%5 B %*. -hich of the following is tr$e/ +a) L is recursively enumerable but L3 is not +b) L3 is recursively enumerable but L is not +c) <oth L and L3 are recursive +d) Neither L nor L3 is recursively enumerable Q**6. 8efine lang$ages %5 and %* as follows& %5={E7,7*,5327 is e>$ivalent to 7*} %*={E7,7*,*32 7 is not e>$ivalent to 7*} Cere E7,w,=3 is a triplet, whose first co.ponent, 7 is an encoding of a t$ring .achine , second co.ponent 7* is the encoding of a *55 tape nondeter.inistic t$ring .achine that halts on all inp$ts, and third co.ponent = is a bit. %et %=%5 B %*. -hich of the following is tr$e/ +a) L is recursively enumerable but L3 is not

+b) L3 is recursively enumerable but L is not +c) <oth L and L3 are recursive +d) Neither L nor L3 is recursively enumerable

Q**9. 8efine lang$ages %5 and %* as follows& %5={E7,w,5327 in the co$rse of its co.p$tation visits state w} %*={E7,w,*32 7 does not halt visit state w} Cere E7,w,=3 is a triplet, whose first co.ponent, 7 is an encoding of a nondeter.inistic 69< p$shdown tape .achine , second co.ponent w, is a state and third co.ponent = is a bit. %et %=%5 B %*. -hich of the following is tr$e/ +a) L is recursively enumerable but L3 is not +b) L3 is recursively enumerable but L is not +c) <oth L and L3 are recursive +d)Neither L nor L3 is recursively enumerable Q**<. 8efine lang$ages %5 and %* as follows& %5={E7,w,5327 prints s!.bol w} %*={E7,w,*32 7 never prints s!.bol w} Cere E7,w,=3 is a triplet, whose first co.ponent, 7 is an encoding of a nondeter.inistic 69< p$shdown tape .achine , second co.ponent w, is a s!.bol and third co.ponent = is a bit. %et %=%5 B %*. -hich of the following is tr$e/ +a) L is recursively enumerable but L3 is not +b) L3 is recursively enumerable but L is not

+c) <oth L and L3 are recursive +d)Neither L nor L3 is recursively enumerable

THEORY OF COMPUTATION

Q1. The lan +a e &a,i #,- c,./ i%- or -%.) is A. regular B. context-free but not regular C. context-sensitive but not context-free D.type- but not context-sensitive

Q0. The lan +a e &a,i #,- c,./.%min1i(-2) is A. regular B. context-free but not regular C. context-sensitive but not context-free D.type- but not context-sensitive

Q3. Dhe lang$age {a1i b1, c1"2 "= .a;'i,,(} os %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q4. Dhe lang$age {a1n b1n c1i2 iE3n} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q0. Dhe lang$age {a1i b1, c1"2 iE="E=2,} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q4. Dhe lang$age {a1i b1, c1"2iE,E"} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q6. Dhe lang$age {a1i b1, c1"2i),3="} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q9. Dhe lang$gae {a1i b1, c1"2"E=i or "E=,} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q<.{a1i b1i c1, d1,2i,,3=*} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*5. Dhe lang$age {a1i b1i c1, d12 e13i2i,,3=*} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q**. Dhe lang$age {w2 w has e>$al n$.ber of aNs, bNs and cNs } is %. regular <. context'free but not regular !. context'sensitive but not context'free

&.type'$ but not context'sensitive

Q*2. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*3. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular <. deterministic context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*4. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular <. context'free but not deterministic context free !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*0. {51i *1,a21i2,3=i} B {51i *1,b21i2,3=i} is %. regular

<. context'free but not deterministic context free !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*4. {51i *1,a21i2,3=i} B {51i *1,b21i2,3=i} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q *6. Dhe lang$age {a1nO2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*9. Dhe lang$age {a1ceil'log2n(2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q*<. {51n *1n122n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q25. Dhe lang$gae {a1p2p pri.e} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q2*. Dhe lang$age {51p2p not pri.e} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q22. 5121n2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free

&.type'$ but not context'sensitive

Q23. Dhe lang$age {a1i b1, c1,2,3=i} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q24. Dhe lang$age {a1i b1i c1i2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q20. Dhe lang$age {a1i b1, c1"2i,,,"3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q24. Dhe lang$age {a1i b1, c1" 2 iE3, or ,E3" or "E3i} is %. regular

<. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q26. Dhe lang$age {w2 w in binar! is a pri.e} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q29. {51n *1n2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q2<. Dhe lang$ge {51* *1,2gcd'i,,(=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q35. {w2 w has e>$al n$.ber of aNs and bNs } is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q3*.Dhe lang$age {ww2 w a string over the alpahabet} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q32. Dhe set of all palidro.es over so.e alphabet is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q33. Dhe lang$ge {a1i b1, c1" d1l2 i=5 or ,="=l} is %. regular <. context'free but regular !. context'sensitive but not context'free

&.type'$ but not context'sensitive

Q34. Dhe lang$age {w2 w in {5,*}* and w does not have three consec$tive 5Ns} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q30. Dhe lang$age {;w;?2;,w in '5)*()} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q34. Dhe lang$age {;;?w2s,w in '5)*()} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q36.Dhe lang$age {w2 w is the set of all balanced parenthesis} is %. regular

<. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q39. Dhe lang$age {w2 w is a well@for.ed reg$lar e;pression over so.e alphabet} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q3<. Dhe lang$age {w2 strings not of the for. ;;, ; in '5)*(*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q45. Dhe lang$ge {w2 w is not of the for. a1n b1n c1n } is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q4*.Dhe set {5,*,P})@{b*Pb2P...Pbn2n3=*} where bi is the binar! representation of i is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q42. Dhe lang$age {a1i b1, c1" d1l2 i= , or ,="} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q43. Dhe lang$age 'a)b(*@{'a1nb1n(1n2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q44. Dhe lang$age {ww?w2 w in 'a)b()} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q40. Dhe lang$ge {biPb'i)*(2bi is in binar! } is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q44. Dhe lang$ge {w;w2 w, ; in 'c)d(*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q46. Dhe lang$ge 'a)b(*@{'a1nb1n(1n2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q49. Dhe lang$ge {a1n b1nc1i2 i E3 n} is %. regular <. context'free but regular

!. context'sensitive but not context'free &.type'$ but not context'sensitive

Q4<. Dhe lang$age {a1nO2n3=*} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q05. Dhe lang$ge {w2 w has e>$al n$.ber of aNs,bNs, cNs or e>$al n$.ber aNs, bNs and dNs} is %. regular <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive

Q0*. Dhe lang$age {a1i b1, c1"2 i=, or ,="} is %. regular but not finite <. deterministic context'free but not regular !. context'sensitive but not regular &.type'$ but not context'sensitive

Q02. Dhe lang$age {a1i b1, c1"2"=.in'i,,(} is %. regular but not finite <. context'free but deterministic context free !. context'sensitive but not deterministic context'free &.recursive but not context'sensitive

Q03. Dhe lang$age {a1i b1, c1"2 "= .a;'i,,(} os %. regular but not context'free <. context'free but not regular !. context'sensitive but not context'free &.recursive but not context'sensitive

Q04. Dhe lang$age {a1n b1n c1i2 iE3n} is %. regular but not finite <. context'free but not regular !. context'sensitive but not deterministic context'free &.recursive but not context'sensitive

Q00. Dhe lang$age {a1i b1, c1"2 iE="E=2,} is %. regular but not finite <. context'free but not deterministic context'free !. context'sensitive but not context'free

&.recursive but not context'sensitive

Q04. Dhe lang$age {a1i b1, c1"2iE,E"} is %. regular but not finite <. context'free but not regular !. context'sensitive but not context'free &.recursive or type'$ but not context'sensitive

Q06. Dhe lang$age {a1i b1, c1"2i),3="} is %. regular but not finite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q09. Dhe lang$gae {a1i b1, c1"2"E=i or "E=,} is %. regular but not finite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q0<.{a1i b1i c1, d1,2i,,3=*} is %. regular but not finite

<. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q45. Dhe lang$age {a1i b1i c1, d12 e13i2i,,3=*} is %. regular and finite <. context'free but not regular !. context'sensitive but not context'free &.recursive but not context'sensitive Q4*. Dhe lang$age {w2 w has e>$al n$.ber of aNs, bNs and cNs } is %. regular but not finite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive Q42. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular but not finite <. context'free but not regular !. context'sensitive but not context'free &.recursive but not context'sensitive

Q43. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular and finite

<. deterministic context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q44. Dhe lang$age {51n*1n2n3=*} B {51n *12n2n3=*} is %. regular but not finite <. context'free but not deterministic context free !. context'sensitive but not context'free &.type'$or recursive but not context'sensitive

Q40. {51i *1,a21i2,3=i} B {51i *1,b21i2,3=i} is %. regular and not finite <. context'free but not deterministic context free !. context'sensitive but not context'free &.type'$ but nor recursive

Q44. {51i *1,a21i2,3=i} B {51i *1,b21i2,3=i} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q 46. Dhe lang$age {a1nO2n3=*} is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q49. Dhe lang$age {a1ceil'log2n(2n3=*} is %. regular and also deterministic context free <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q4<. {51n *1n122n3=*} is %. regular and not finite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q65. Dhe lang$gae {a1p2p pri.e} is %. regular and not finite <. context'free but regular

!. context'sensitive but not context'free &.type'$ but not context'sensitive or deterministic context free

Q6*. Dhe lang$age {51p2p not pri.e} is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q62. 5121n2n3=*} is %. regular and not finite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q63. Dhe lang$age {a1i b1, c1,2,3=i} is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or deterministic context'free

Q64. Dhe lang$age {a1i b1i c1i2n3=*} is

%. regular and not deterministic context free <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q60. Dhe lang$age {a1i b1, c1"2i,,,"3=*} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.recursive but not context'sensitive

Q64. Dhe lang$age {a1i b1, c1" 2 iE3, or ,E3" or "E3i} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q66. Dhe lang$age {w2 w in binar! is a pri.e} is %. regular and not finite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q69. {51n *1n2n3=*} is %. regular and not finite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q6<. Dhe lang$ge {51* *1,2gcd'i,,(=*} is %. regular and not infinite <. context'free but regular !. context'sensitive but not context'free &.recursive but not context'sensitive

Q95. {w2 w has e>$al n$.ber of aNs and bNs } is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or deterministic context'free

Q9*.Dhe lang$age {ww2 w a string over the alpahabet} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free

&.type'$ but not context'sensitive or recursive

Q92. Dhe set of all palidro.es over so.e alphabet is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or deterministic context free

Q93. Dhe lang$ge {a1i b1, c1" d1l2 i=5 or ,="=l} is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q94. Dhe lang$age {w2 w in {5,*}* and w does not have three consec$tive 5Ns} is %. regular and infinite <. context'free but not regular and not determinitstic context free !. context'sensitive but not context'free &.type'$ but not context'sensitive and not recursive

Q90. Dhe lang$age {;w;?2;,w in '5)*()} is %. regular and infinite

<. context'free but regular and not deterministic context'free !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q94. Dhe lang$age {;;?w2s,w in '5)*()} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q96.Dhe lang$age {w2 w is the set of all balanced parenthesis} is %. regular and finite <. context'free but not regular and is infinite !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q99. Dhe lang$age {w2 w is a well@for.ed reg$lar e;pression over so.e alphabet} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.recursive but not context'sensitive

Q9<. Dhe lang$age {w2 strings not of the for. ;;, ; in '5)*(*} is %. regular and infinite <. context'free but not regular or deterministic context'free !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<5. Dhe lang$ge {w2 w is not of the for. a1n b1n c1n } is %. regular and infinite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<*.Dhe set {5,*,P})@{b*Pb2P...Pbn2n3=*} where bi is the binar! representation of i is %. regular and infinite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<2. Dhe lang$age {a1i b1, c1" d1l2 i= , or ,="} is %. regular and infinite <. context'free but not regular or deterministic context free !. context'sensitive but not context'free

&.type'$ or recursive but not context'sensitive

Q<3. Dhe lang$age 'a)b(*@{'a1nb1n(1n2n3=*} is %. regular and finite <. context'free but not regular or deterministic context'free !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q<4. Dhe lang$age {ww?w2 w in 'a)b()} is %. regular and finite <. context'free but not regular !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q<0. Dhe lang$ge {biPb'i)*(2bi is in binar! } is %. regular and finite <. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<4. Dhe lang$ge {w;w2 w, ; in 'c)d(*} is %. regular and infinite

<. context'free but not regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<6. Dhe lang$ge 'a)b(*@{'a1nb1n(1n2n3=*} is %. regular and infinite <. context'free but not regular or deterministic context'free !. context'sensitive but not context'free &.type'$ but not context'sensitive or recursive

Q<9. Dhe lang$ge {a1n b1nc1i2 i E3 n} is %. regular and finite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q<<. Dhe lang$age {a1nO2n3=*} is %. regular and infinite <. context'free but not regular !. context'sensitive but not context'free or deterministic context'free &.type'$ but not context'sensitive or recursive

Q*55. Dhe lang$ge {w2 w has e>$al n$.ber of aNs,bNs, cNs or e>$al n$.ber aNs, bNs and dNs} is %. regular and infinite <. context'free but regular !. context'sensitive but not context'free &.type'$ or recursive but not context'sensitive

Q*5*. Dhe lang$age {a1.b1nc1'.)n(2.,n3=*} is %. regular <.context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

/(%)0 #$$@2 Q*52. Dhe lang$age {a51n *1n2n3=*} B{b51n *12n2n3=*} is %. regular <.context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q*54. Dhe lang$age {a51n *1n2n3=*} B{b51n *12n2n3=*} is %. regular <.deterministic context'free but not regular

!. context'sensitive but not context'free &. type$ but not context sensitive

Q*50. Dhe lang$age {a51n *1n2n3=*} B{b51n *12n2n3=*}B {c51n *14n 2n3*} is %. regular <.context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q*54. Dhe lang$age {a51n *1n2n3=*} B{b51n *12n2n3=*}B {51n*19<n2n3=*} is %. regular <.deterministic context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q*56. Dhe lang$age {aww?b;;?c!!?2;,!,Q in {5,*}*}is %. regular <.context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q*59. Dhe lang$age {aww?b;;?c!!?dww?2;,!,w in '5)*(*}is

%. regular <.deterministic context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q*5<. + lang$age denoted b! a se.i@e;tended reg$lar e;pression which is reg$lar e;pression with the additional operation of intersection of reg$lar e;pressions is %. regular <.context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q**5. + lang$age denoted b! e;tended reg$lar e;pressions which is reg$lar e;pressions with the operations of intersection and co.ple.entation is %. regular <.deterministic context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q***. Dhe lang$age {wPw?P2w in '5)*()} B{ww?2w in '()*)2(*} is %. regular <.context'free but not regular !. context'sensitive but not context'free

&. type$ but not context sensitive

Q**2. Dhe lang$age {a51n *1n 21n2n3=*} B{b51n *12n2n3=*}B {51n*19<n2n3=*} is %. regular <.deterministic context'free but not regular !. context'sensitive but not context'free &. type$ but not context sensitive

Q**3. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. intersection <. union !. complement &. inverse substitution

Q**4. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. ,%A <. ,8N !. 8N8) &. inverse substitution

Q**0. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. !B!L0

<. 8N)0CL0%D8N( !. C0D0C"%L &. inverse substitution

Q**4. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. intersection <. "E<")8)E)89N !. complement &. inverse substitution

Q**6. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. uotient with a regular set <. uotient with a context free language !. uotient with a context'free language &. inverse substitution

Q**9. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. uotient with a recusive set <. uotient with a r.e. language !. uotient with any formal language &. inverse substitution

Q**<. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. Fleene closure <. uotient with a context free language !. uotient with a context'free language &. inverse substitution

Q*25. Choose the false state.ent. %et % be an! for.al lang$age %. L- is regular <. L- is not necessaily regular !. L- is context'free and not regular &. L- is r.e. and not recursive Q*2*. Choose the false state.ent. Dhe reg$lar sets are closed $nder %. homomorphism <. uotient with a deterministic context free language !. inverse homomorphism &. inverse substitution Q*22. %et % be a for.al lana$gae. Dhe set %half is obtained b! ta"ing the first halves of strings in %. Choose the tr$e state.ent %. 8f L is regular then Lhalf is regular <. 8f L is regular then Lhalf is not regular !. 8f L is a cfl then Lhalf is a cfl &. 8f L is a csl then Lhalf is a cfl

Q*23. Dhe cfls are not closed $nder %. substitution5 homomorphism5 union <. union5 conctenation5 Fleene closure !.homomorphism5 inverse homomorphism5 intersection with a regular set &. inverse substitution

Q*24. Dhe cfls are not closed $nder %. ,8N5,%A <. union5Fleene closure5 8N8) !. !B!L0 &. reversal

Q*20. Dhe cfls are not closed $nder %. half''the language formed by taking the first halves of strings of a cfl <. gsm mappings !. Fleene closure5 intersection with a regular set &. complement

Q*24. Dhe co.ple.ents of the cfls {a1nb1nc1n2n3=*} and {ww2w in '5)*()}are %. Cegular5 Cegular <. both cfls

!. both csls but not cfls &. !;L and regular

Q*26. Dhe cls are not closed $nder %. union <. intersection !. substitution &. uotient with a regular set

Q*29. Dhe rec$rsive sets are not closed $nder %. complementation <. union !. intersection &. substitution

Q*2<. Dhe rec$rsivse sets are not closed $nder %. homomorphism <. e'free homomorphism !. intersection &. positive Fleene closure

Q*35. Dhe r.e. sets are not closed $nder

%. union <. intersection !. complement &. reversal

Q*3*. Dhe r.e. sets are not closed $nder %. intersection <. substitution !. !B!L0 &. complement

Q*32. Dhe co.ple.ent of a r.e. set % that is not rec$rsive %.may be recursive <. is always r.e. !. is not r.e. &. may be a csl

Q*33. Choose the false state.ent. Dhe cfls are not closed $nder intersection. Dhe intersection of two cfls .a! be %. regular <. cfl !.csl

&. not r.e.

Q*34. Dhe 8CK%s are not closed $nder'choose the false state.ent( %. union5 Fleene closure5 homomorphism <. positive Fleene closure5 reversal !. concatenation5 8N8) &.complementation

Q*30. Dhe 8CK%s are not clsoed $nder'choose the false state.ent( %. union5 substitution <. ,8N5,%A !. intersection &. inverse substitution

Q*34. Choose the false state.ent. Dhe following lang$ages are closed $nder reversal %. Cegular <. cfls !.dcfls &. recursive sets

Q*36. Choose the false state.ent. Dhe following lang$ages are closed $nder reversal

%. r.e. sets <. csls !.dcfls &. recursive sets

Q*39. Choose the false state.ent. Dhe following lang$ages are closed $nder co.ple.ent %. regular sets <. dcfls !. cfls &. recursive sets

Q*3<. Choose the false state.ent. Dhe following lang$ages are closed $nder co.ple.ent %. regualar sets <. r.e. sets !. dcfls &. recursive sets

Q*3<. Choose the false state.ent. Dhe following lang$ages are closed $nder co.ple.ent %. regular sets <. dcfls

!. finite sets &. recursive sets

Q*45. Dhe following lang$ages are closed $nder s$bstit$tion'choose the false state.ent( %. regular sets <. dcfls !. cfls &. r.e. sets Q*4*. Dhe following lang$ages are closed $nder s$bstit$tion'choose the false state.ent( %. regular sets <. cfls !. csls &. recursive sets Q*42. Choose the false state.ent. Dhe reversal of a dcfl % is a. never r.e. b. is always r.e. c. is always a cfl d. is always a csl

Q*43. Choose the false state.ent. Dhe reversal of a dcfl % is a. always a dclf b. always a cfl c. always a recursive set

d. always a r.e. set

Q*44. Choose the false state.ent. Dhe $nion of two dcfls is a. never r.e. b. is always r.e. c. is always a cfl d. is always a csl

Q*40. Choose the false state.ent. Dhe $nion of two dcfls is a. always a dclf b. always a cfl c. always a recursive set d. always a r.e. set

Q*44. Dhe intersection of two cfls can si.$late an arbitrar! t$ring .achine co.p$tation, and this can be $sed to show so.e proble.s are $ndecidable. Dhe intersection of two cfls is 'choose the false state.ent( a. never regular b. never a cfl c. never a csl d. always not r.e.

Q*46. Dhe intersection of two dcfls can si.$late an arbitrar! t$ring .achine

co.p$tation, and this can be $sed to show so.e proble.s are $ndecidable. Dhe intersection of two dcfls is 'choose the false state.ent( a. never regular b. never a cfl c. never a csl d. always not r.e.

Q*49. Dhe intersection of two csls can si.$late an arbitrar! t$ring .achine co.p$tation, and this can be $sed to show so.e proble.s are $ndecidable. Dhe intersection of two csls is 'choose the false state.ent( a. never a recursive set b. never a cfl c. never a csl d. always not r.e.

Q*4<. =t is not "nown at present if the csls are closed $nder co.ple.ent. Dhe co.ple.ent of a csl'choose the false state.ent( is a. never a cfl b. never a csl c. never a recursive set d. may be a set which is not r.e.

Q*05. Dhe sh$ffle of lang$ages %* and %2 is obtained b! sh$ffling the words of %* with that of %2. Choose the false state.ent a. the shuffle of two regular sets is regular

b. the shuffle of two cfls is a cfl c. the shuffle of a cfl and a regular set is a cfl d. the shuffle of a regular set and a cfl may be regular

Q*0*. Dhe following proble.s are decidable a. whether a turing machine has at least three states b. whether a turing machine will ever halt c. whether a turing machine will ever print a symbol d. whether a turing machine will ever enter a designated state

Q*02. Dhe following proble.s are decidable a. whether a turing machine ever leaves a particular cell it it scanning b.whether a turing machine started on blank tape will ever halt c. whether a turing machine accepts at least two strings d. whether a turing machine accepts a finite set

Q*03. Dhe following proble.s are decidable a. whether the tape alphabet has at least two symbols b. whether a turing machine with *# tapes will accept an infinite set c. for ever string w the turing machine accepts it also accepts wC. d. whether a turing machine will ever print three consecutive *Gs

Q*04. %et %*={E732 7 is the encoding of a finite a$ot.aton} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a t$ring .achine}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L#=L*

Q*00. %et %*={E732 7 is the encoding of a finite a$ot.aton} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a t$ring .achine}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains all strings over the termainal vocabuary b. Whether L* is empty and regular c. Whether L* is infinite d. Whether L# is contained in L*

Q*04. %et %*={E732 7 is the encoding of a finite a$ot.aton} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a t$ring .achine}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# intersection L* is empty

Q*06. %et %*={E732 7 is the encoding of a finite a$ot.aton} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a finite .achine}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. None of the above

Q*04. %et %*={E732 7 is the encoding of a dpda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a dpda .achine}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# intersection L* is infinite

Q*06. %et %*={E732 7 is the encoding of a dpda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a dpda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# is contained in L*

Q*09. %et %*={E732 7 is the encoding of a dpda} and w is a string in '5)*(*. %et %2={E732

7 is the encoding of a dpda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# intersection L* is empty

Q*0<. %et %*={E732 7 is the encoding of a dpda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a dpda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* contains w b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# intersection L* is a dcfl

Q*45. %et %*={E732 7 is the encoding of a dpda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a dpda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether the complement of L* is contained in L# b. Whether the complement of L* is empty c. Whether the complement of L* is infinite d. Whether L# intersection L* is a csl Q*4*. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a pda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w

b. Whether L* is empty c. Whether L* is infinite d. Whether L# intersection L* is empty Q*42. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a pda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L# contains all strings over the terminal vocabulary

Q*43. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a pda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L# = L*

Q*44. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a pda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L# is contained in L*

Q*40. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a finite a$to.ata}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L# = L*

Q*44. %et %*={E732 7 is the encoding of a pda} and w is a string in '5)*(*. %et %2={E732 7 is the encoding of a pda}. Dhe following proble.s are decidable'choose the false state.ent( a. Whether L* contains w b. Whether L* is empty c. Whether L* is infinite d. Whether L# intersection L* is empty

Q*46. ?a. co.es $p with a $niversal lang$age for cfls, %$cfl={E7,;327 is the encoding of a pda that accepts w}. Choose the correct state.ent a.Lucfl is a decidable language b. Lucfl is partially decidable but not decidable c.Lucfl is not partially decidable d. Lucfl cannot exist

Q*49. ?a. co.es $p with a $niversal lang$age for dcfls, %$dcfl={E7,;327 is the encoding of a dpda that accepts w}. Choose the correct state.ent a.Ludcfl is a decidable language b. Ludcfl is partially decidable but not decidable c.Ludcfl is not partially decidable d. Ludcfl cannot exist

Q*4<. ?a. co.es $p with a $niversal lang$age for labas, %$lba={E7,;327 is the encoding of a lba that accepts w}. Choose the correct state.ent a.Lulba is a decidable language b. Lulba is partially decidable but not decidable c.Lulba is not partially decidable d. Lulba cannot exist

Q*65. ?a. co.es $p with a $niversal lang$age for t$ring .achines, %$={E7,;327 is the encoding of a t$ring that accepts w}. Choose the correct state.ent a.Lu is a decidable language b. Lul is partially decidable but not decidable c.Lul is not partially decidable d. Lul cannot exist

Q*6*. ?a. co.es $p with a $niversal lang$age for halting t$ring .achines, %$={E7,;327 is the encoding of a halting t$ring .achine that accepts w}. Choose the correct state.ent a.Lu is a decidable language

b. Lu is partially decidable but not decidable c.Lu is not partially decidable d. Lu cannot exist

Q*62. %et %5={E7,w,532 7 is the encoding of a pda that halts on inp$t w} and let %*={E7,;,*32 7 is the encoding of a pda that does not halt on inp$t w} &efine a language L=L$EL*. What can be said about L: a. L is decidable b. L is partially decidable but not decidable c. L is not partially decidable d. L is accepted by a pda

Q*63. %et %5={E7,w,532 7 is the encoding of a lba that halts on inp$t w} and let %*={E7,;,*32 7 is the encoding of a lba that does not halt on inp$t w} &efine a language L=L$EL*. What can be said about L: a. L is decidable b. L is partially decidable but not decidable c. L is not partially decidable d. L is accepted by a pda

Q*64. Dhe following proble.s of csls are decidable

a. the e uivalence problem b.the containment problem c. the membership problem d. the completeness problem

Q*60.Dhe following proble.s of csls are decidable a. the emptiness problem b.the finiteness problem c. the infiniteness problem d. whether the intersection of two csls is a csl

Q*64. Dhe following proble.s of csls are decidable a. the e uivalence problem b. whether the intersection of two csls is empty c. the regularity problem d. whether the complement of a csl is a recursive set

Q*66. Dhe following proble.s of rec$rsive sets are decidable a. the membership problem b. the emptiness problem c.the completeness problem d. the finiteness problem

Q*69. Dhe following proble.s of rec$rsive sets are decidable a. the infiniteness problem b. the e uivalence problem c. the containment problem d.whether the complement is recursive

Q*6<. Dhe following proble.s of rec$rsive sets are decidable a. whether the recursive language is e ual to a regular set C b. the regularity problem c. the e uivalence problem d. the completeness problem

Q*95. Dhe following proble.s of rec$rsive sets are decidable a. the halting problem b. the e uivalence to a given r.e. set c. the e uivalence to a given csl d. the e uivalence to a given cfl Q*9*. Dhe following proble.s of r.e. sets are decidable a. the membership problem b. the emptiness problem c.the finiteness problem

d. whether the intersection of two r.e. sets is a language of the same type

Q*92. Dhe following proble.s of r.e. sets are decidable a. the infiniteness problem b.the e uivalence problem c. the containment problem d. whether the union of two r.e. sets is of the same type Q*93. Dhe following proble.s of r.e. sets are decidable a. whether the intersection of two r.e. sets is empty b. whether the r.e. set is e uivalent to a given regular set c. whether the r.e. set is regular d. whether the Fleene closure of a r.e. set is a r.e. set

Q*94. Dhe following proble.s of r.e. sets are decidable a. whether the complement of a r.e. set is r.e. b.whether the r.e. set is a csl c. whether the r.e. set is a cfl d.whether the reversal of the r.e. set is r.e.

Q*90. Choose the correct state.ent. Dhe following proble.s are decidable a. whether a regular set is finite b. whether a cfl is regular

c. whether a csl is a cfl d. whether a recursive set is a csl

Q*94. Choose the correct state.ent )he following problems are decidable

a. whether a dcfl is finite b. whether a recursive set is a cfl c. whether a r.e. set is a csl d. whether a r.e. set is a dcfl

Q*96. Dhe following proble.s are decidable !hoose the correct statement a. whether a dcfl is r.e. b. whether a recursive set is regular c. whether a recursive set if regular but not infinite d. whether a r.e. set is a dcfl that is infinite

Q*99. Dhe following proble.s are #@co.plete.'Choose the correct one(. a. *"%) b. #"%) c. 1"%)

d. hamiltonian circuit problem where the graph does not have more than *$$7*$$$ nodes

Q*9<. Dhe following proble.s are not a. $H* knapsack problem

#@co.plete. 'Choose the correct one(.

b. node cover problem with the graphs having more than *$$7*$$ nodes c.edge cover problem with graphs having edges more than *$$7*$$ nodes d. travelling salesman problem with the number of nodes in the graph restricted to *$$7*$$ nodes

Q*<5. Dhe following proble.s are not a. the partition problem b. the chromatic number problem c. the integer programming problem d. the all pairs shortest path problem

#@co.plete.'Choose the correct one(.

Q*<*. Choose the false state.ent )he following can be effectively enumerated a. finite automata b.deterministic push down automata c. push down automata d. halting turing machines

Q*<2. Choose the false state.ent

)he following can be effectively enumerated a. deterministic linear bounded automata b. linear bounded automata c.halting turing machines d. turing machines

Q*<3. choose the false state.ent )he following can be effectively enumerated a. multidimensional turing machines b. multitrack turing machines c. multiheaded turing machines d. halting turing machines

Q*<4. Choose the false state.ent )he following can be effectively enumerated a. finite sets b. regular sets c. dcfls d. recursive sets

Q*<0. Choose the false state.ent )he following can be effectively enumerated

a. cfls b.csls c. recursive sets d. r.e. sets

Q*<4. Choose the false state.ent )he following can be effectively enumerated a. type'$ grammars b. halting turing machines c. type'* grammars d. type # grammars

Q*<6. Choose the false state.ent Dhe following can be effectivel! en$.erated a. type'$ grammars b. halting turing machines c. type'* grammars d. type 1 grammars

Q*<9. ?a. and Sh!a. define $niversal lang$ages as follows %5={E7,;,*327 is the encoding of a t$ring .achine that accepts ;}

%55={E7,;,*327 is the encoding of a halting t$ring .achine that accepts ;} %*={E7,;,*32 7 is the encoding of a linear bo$nded a$to.ata that accepts ;} %2={E7,;,*32 7 is the encoding of a p$sh down a$to.ata that accepts ;} %22={E7,;,*32 7 is the encoding of a dpda that accepts ;} %3={E7,;,*32 7 is the encoding of a fa that accepts ;} Choose the correct state.ent a. all the universal languages are r.e. b. the complements of all the universal languages are r.e. c. all the universal languages are recursive d. except L$$ all the universal languages are r.e.

Q*<<. ?a. and Sh!a. define $niversal lang$ages as follows %5={E7,;,*327 is the encoding of a t$ring .achine that accepts ;} %55={E7,;,*327 is the encoding of a halting t$ring .achine that accepts ;} %*={E7,;,*32 7 is the encoding of a linear bo$nded a$to.ata that accepts ;} %2={E7,;,*32 7 is the encoding of a p$sh down a$to.ata that accepts ;} %22={E7,;,*32 7 is the encoding of a dpda that accepts ;} %3={E7,;,*32 7 is the encoding of a fa that accepts ;} Choose the correct state.ent a. all the universal languages are recursive. b. the complements of all the universal languages are recursive

c. all the universal languages are r.e. d. except L$$ all the universal languages are r.e.

Q255. ?a. and Sh!a. define $niversal lang$ages as follows %5={E:,;,*32: is the encoding of a t!pe 5 that generates ;} %55={E:,;,*32: is the encoding of a t!pe 5 gra..ar that generates a rec$rsive set and generates ;} %*={E:,;,*32 : is the encoding of a t!pe * gra..ar that generates ;} %2={E:,;,*32 : is the encoding of a t!pe 2 gra..ar that generates ;} %22={E:,;,*32 : is the encoding of a %?'"( gra..ar that generates ;} %3={E:,;,*32 : is the encoding of a t!pe 3 gra..ar that generates ;} Choose the correct state.ent a. all the universal languages are r.e. b. the complements of all the universal languages are r.e. c. all the universal languages are recursive d. except L$$ all the universal languages are r.e. Q25*. Consider t$ring .achines as en$.erators. -e define a lang$age %=IE732 7 is the encoding a t$ring .achine that en$.erates the strings it accepts in le;icographic order}. Choose the correct state.ent. a. L is a csl b. L is recursive c. L is r.e. and not recursive

d. L is not r.e. Q252.?a. and Sh!a. decide to classif! a hierarch! of t$ring .achines as follows& %5={E7327 is the encoding of t$ring .achines that accept the rec$rsive sets} %*={E7327 is the encoding of t$ring .achines that accept the csls} %2={E7327 is the encoding of t$ring .achines that accept the cfls} %22={E7327 is the encoding of t$ring .achines that accept the dcfls} %3={E7327 is the encoding of t$ring .achines that accept the reg$lar sets} %4={E7327 is the encoding of t$ring .achines that accept the finite sets} Choose the correct state.ent a. all the above languages are recursive b. all the above languages are r.e. c. all the above languages are not r.e. d. all the above languages are r.e and not recursive

Q253. Dhe gra..ar S@@@@3aSbS2bSaS2e is a. ambiguous b. generates an inherently ambiguous language c. is not ambiguous d. generates an une ual number of aGs and bGs

Q254. Dhe gra..ar

S@@@@@@3aSbS2bSaS2e i a. generates an e ual number of aGs and bGs b. generates an une ual number of aGs and bGs c. generates more aGs than bGs d.generates more bGs than aGs

Q250. Dhe gra..ar S@@@3aR2b+ +@@@@@3a2aS2b++ R@@@@@3b2bS2aRR a. is ambiguous b. generates an inherently ambiguous language c.is unambiguous d. generates an une ual number of aGs and bGs

Q254. Dhe gra..ar S@@@3aR2b+ +@@@@@3a2aS2b++ R@@@@@3b2bS2aRR a. generates an e ual number of aGs and bGs b. generates an inherently ambiguous language c.generates more aGs than bGs

d. generates an une ual number of aGs and bGs

Q256. Dhe gra..ar S@@@3aSRC2aRC aR@@@3ab bR@@@@3bb bC@@@3bc cC@@@@3cc a. generates a regular set b.generates a cfl c. generates a dcfl d. generates a csl

Q259. Dhe gra..ar S@@@3aSRC2aRC aR@@@3ab bR@@@@3bb bC@@@3bc cC@@@@3cc a. generates the set of all strings with an e ual number of aGs5 bGs and cGs b.generates 4a7nb7n !7n?n>=*6l c. generates more aGs than bGsl

d. generates more bGs than cGs

Q25<. Dhe gra..ar S@@@3aSRC2aRC aR@@@3ab bR@@@@3bb bC@@@3bc cC@@@@3cc a. is type'$ and not type'* b.type'* and not type'# c. type'# and not type'*l d. type'1 and not type'#

Q2*5. Dhe gra..ar S@@@3aSRC2aRC aR@@@3ab bR@@@@3bb bC@@@3bc cC@@@@3cc a. is in !N; form b.is in (N; form c. generates a dcfl that is not regular

d. generates a csl that is not regular

Q2**. Dhe gra..ar S@@@3aSRC2aRC aR@@@3ab bR@@@@3bb bC@@@3bc cC@@@@3cc generates a lang$age that can be accepted b! a a. linear bounded automata b.a push down automata c. a deterministic push down automata d. a finite automata

Q2*2. Consider the following gra..ar S@@@@3bS2a+2b +@@@@3b+2aR R@@@3bR2aS2a %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>1Nb+w)6 <.4w?Nb+w)>1Na+w)6 !.4w?Na+w)=1k5 k=$5*5#5...6

&.4w?Nb+w)=1k5 k = $5*5#5...6 /(%)0 #$$@2

Q2*3.. Consider the following gra..ar S@@@@3bS2a+2b +@@@@3b+2aR R@@@3bR2aS2a %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w in the reversal of the lang$age. Dhen the lang$age reversal of %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>1Nb+w)6 <.4w?Nb+w)>1Na+w)6 !.4w?Na+w)=1k5 k=$5*5#5...6 &.4w?Nb+w)=1k5 k = $5*5#5...6

Q2*4. Consider the following gra..ar S@@@@3Sb2+a2b +@@@@3+b2Ra R@@@3Rb2Sa2a %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>1Nb+w)6 <.4w?Nb+w)>1Na+w)6 !.4w?Na+w)=1k5 k=$5*5#5...6 &.4w?Nb+w)=1k5 k = $5*5#5...6

Q2*0. Consider the following gra..ar S@@@@3bS2a+2b +@@@@3b+2aR R@@@3bR2aS2a Dhe lang$age generated b! the gra..ar is a. r.e but not recursive b. recursive but not csl c.csl but not cfl d. regular but not finite

Q2*4. Consider the following gra..ar S@@@@3bS2a+2b +@@@@3b+2aR R@@@3bR2aS2a Dhe gra..ar is a. type'$ but not type'* b. type'* but not type'# c. type'# but not type'1 d. type'1

Q2*6. Consider the gra..ar

S@@@3+S2++ +@@@3a+b2ab %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6 &.4w?Nb+w)not related to Na+w)6

Q2*9. Consider the gra..ar S@@@3aSa2bSb2aa2bb

%et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6 &.4w?Nb+w)not related to Na+w)6

Q2*<. Consider the gra..ar S@@@3aSa2bSb2aSb2bSa2aa2ab2ba2bb %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is

%. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6 &.4w?Nb+w)not related to Na+w)6

Q225. Consider the gra..ar S@@@3+R +@@@3a+b2ab R@@@3b2bR %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6 &.4w?Nb+w)not related to Na+w)6 Q22*. Consider the gra..ar S@@@3+R+RS2+R +@@@3a2a+ R@@@@3b2bR %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6

&.4w?Nb+w)not related to Na+w)6 Q222.Consider the gra.a.ar. S@@@3aa+Sb2ab +@@@3a+b2ab %et a'w( and b'w( denote the n$.ber of aNs and bNs in a string w. Dhen the lang$age %':( a s$bset of 'a)b() generated b! : is %. 4w? Na+w)>Nb+w)6 <.4w?Nb+w)=Na+w)6 !.4w?Na+w)=Nb+W)6 &.4w?Nb+w)not related to Na+w)6

Q223. Dhe lang$age {a1n b1n c1n2n3*} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q224. Dhe lang$age {a1i b1, c1"2i3,3"} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q220. Dhe lang$age {a1i b1, c1"2"=.in'i,,(} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q224. Dhe lang$age {a1i b1, c1"2"=.a;'i,,(} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q226. Dhe lang$age {a1n122n3*} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q229. Dhe lang$age {a121n2n3*} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar

c. can be generated by a type # grammar d. can be generated by a type * grammar

Q22<. Dhe lang$age {a1n2n3pri.e} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q235. Dhe lang$age {a1n2n not pri.e} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q23*. Dhe lang$age {ww2w in '5)*()} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q232. Dhe lang$age {a1nO2n3*}

a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q233. Dhe lang$age {a1i b1, c1"2iE3, and ,E3" and "E3i} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. can be generated by a type # grammar d. can be generated by a type * grammar

Q234. Dhe lang$age {a1i b1, c1"2i=, or ,=" or "=i} a. can be generated by a type 1 grammar b. can be generated by an LC+k) grammar c. cannot be generated by a type # grammar d. can be generated by a type * grammar