VINAYAKA MISSIONS UNIVERSITY

V.M.K.V ENGINEERING COLLEGE &

AARUPADAI VEEDU INSTITUTE OF TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COURSE: B.E.-(CSSE) SEMESTER: V
THEORY OF COMPUTATION
(COMMON TO CSE / CSSE)
UNIT I
PART A
1. Give short notes about Formal proof.
2. List out the proofs associated with FA.
3. Give the mathematical definition of Additional forms of proof.
4. What are the components are involved in Finite Automation?
. Give the mathematical definition of inductive proof.
!. List out the needs of finite automation.
". Give the formal definition of #FA.
$. What are the needs of epsilon in %FA?
&. Give the formal definition of %FA.
1'. #ifferentiate %FA and #FA.
11. List out the various advanta(es in #FA.
12. Write various advanta(es in %FA over than #FA.
13. )ow will *ou find out the input strin( is accepted or not?
14. )ow will *ou ma+e a final state in the %FA with epsilon to %FA without
epsilon conversion?
1. #efine transition function with one simple e,ample.
1!. )ow will *ou ma+e a final state in the %FA to #FA conversion?
1". -onstruct #FA for .he set of all strin(s '/s and 1/s that end with 11.
1$. -onstruct #FA for 0et of all strin(s over 1'213 with 4 consecutive '/s.
1&. 4btain the #FA e5uivalent to the followin( %FA.
2'. -onsider the transition dia(ram as shown below.
-hec+ whether the input strin( abab is accepted b* FA?
21. Write various applications of automata theor*?
22. -onstruct a %FA for all strin(s over alphabet 671a2b3 that contains a
substrin( 8ab/.
9A:. ;
1. List out various proofs in .4- and <,plain.
2. -onstruct a #FA e5uivalent to the %FA
=7>1p252r2s321'2132 2 p 2 1s3?
Where is defined in the followin( table.
3. 9rove that2 @f L be a set accepted b* a %FA2 then there e,ists a #FA that accept L.
4. For a %FAA moves shown below2 construct an e5uivalent %FA without moves.
. -onstruct %FA without B moves from the %FA (iven in the dia(ram?
!. 9rove that2 Let r be a re(ular e,pression then there e,ist a %FA transition
that accepts L>r?.
". -onstruct a deterministic finite automata e5uivalent to
=7>15'251252253321a2b32 C25'21533? where C is2
C>5'2a?7>5'25132 C>5'2b?7>5'32 C>512a?7>5232 C>512b?7>5132 C>522a?7>5332
C>522b?7>5332 C>532b?7>523.
$. -onstruct an e5uivalent #FA for the followin( %FA (iven below2
&. -onstruct an e5uivalent #FA for the followin( %FA (iven below2
1'. Give ;rief e,planation about %FA to #FA -onversion.
UNIT-II
PART-A
1. Give short notes about re(ular <,pression.
2. -hec+ >aDb?E>cd? is a re(ular e,pression?
3. -hec+ >a.bD? is a re(ular e,pression?
4. Write the +leen/ s theorem for re(ular e,pression.
. List out the closure properties of re(ular sets.
!. Where we are usin( pumpin( lemma and what is that importance?
". Write the applications of pumpin( lemma.
$. 9rove L71'
i
1
F
G iHF3 is not re(ular
&. #ifferentiate recursive and non recursive production.
1'. 0tate :e(ular lan(ua(e
11. Find the shortest strin( that is not in the lan(ua(e represented b* the re(ular
e,pression aE>ab?EbE.
12. Find a re(ular e,pression correspondin( to the lan(ua(e of all strin(s over the
alphabet 1 a2 b 3 that contain e,actl* two aIs.
13. Find the shortest strin( that is not in the lan(ua(e represented b* the re(ular
e,pression aEb>ab?EbE.
14. Find a re(ular e,pression correspondin( to the lan(ua(e of all strin(s over the
alphabet 1 a2b 3 that do not end with ab.
1. -onstruct a re(ular e,pression for the lan(ua(e L has set of all strin( over 1a2b3
with three consecutive b/s.
1!. Write a re(ular e,pression for the set of all strin(s not containin( 81'1/ as
substrin(.
1". Write a re(ular e,pression for the set of all strin(s over >'213 does not include
8'11/ or 8''1/.
1$. 0tate whether the followin( statements are true >or? false
a. <ver* subset of a re(ular set is re(ular.
b. <ver* finite subset of a non re(ular set is re(ular.
c. .he number 122242$JJJ2n written in binar* is accepted b* a FA.
1&. )ow to construct :e(ular e,pression from FA?
2'. Give the advanta(es of re(ular e,pressions.
21. #ifferentiate FA and :e(ular e,pression?
22. Write a re(ular e,pression for the set of all strin(s where substrin( 811/ never
occurs after a substrin( 8''/.
23. Write a re(ular e,pression for the set of all strin(s containin( both the substrin(
8'1/ and substrin( 81'/.
PART-B
1. -onstruct a finite automata e5uivalent of the followin( re(ular e,pression
>>'D1?>'D1??ED>>'D1?>'D1?>'D1??E
2. 0tates that an* lan(ua(e accepted b* a finite automaton is re(ular.
3. <,plain the Kleen/ s theorem in detail.
4. <,plain in detail about construction of FA from :e(ular e,pression.
. -onstruct a %FA for the re(ular e,pression r71E'D'.
!. -onstruct a %FA for the re(ular e,pression r7>>'1D''1?E'E?E
". ;riefl* e,plain about pumpin( lemma.
$. 9rove the followin( (rammars are not re(ular2
a. L71w G w L 1'213E and has e5ual number of '/s and 1/s.
b. L711
i
'
i
G iHF3 is not re(ular.
&. #raw a %FA #ia(ram for followin( re(ular e,pression
>aa>ba?EDbEabaE?
1'. #raw a %FA #ia(ram for followin( re(ular e,pression
>abD>aab?E?>aaDa?
UNIT III
PART A
1. List out the various advanta(es in -FG over :e(ular e,pressions?
2. 0tate -onte,t free (rammer.
3. Give the formal definition of -FG.
4. Give notes about terminal?
. #ifferentiate terminal and non terminal.
!. Let G be the (rammar 0 a;MbA2 AaMa0MbAA2 ;bMb0Ma;;. For the strin(
aaabbabbba find a left most derivation.
". Find the lan(ua(e (enerated b* the (rammar
0a0b2 0ab
$. Find L>G?. G7>102-321a2b32920? where 9 consists of 0a-a2 -a-a M b.
&. Give short notes about left most derivation.
1'. List out various problems b* ambi(uit*.
11. Wh* left factorin( is occurred?
12. )ow do *ou simplif* the conte,t free (rammar?
13. List out the applications of 9umpin( Lemma?
14. #raw the basic dia(ram for 9#A.
1. Wh* we are usin( the stac+ in 9#A?
1!. Wh* we are (oin( to pushdown automata.
1". 0tate that acceptance of a 9#A b* final state.
1$. Give short notes about instantaneous description of a 9#A.
1&. Write the pumpin( lemma for conte,t free lan(ua(e.
2'. List out the wa*s to accept 9#A?
21. Give the dia(rammatic representation of 9#A.
22. Give the difference between readin( the final state and empt* stac+.
23. Find 9#A for .he set of all strin(s of balance parenthesis are properl* nested.
24. List out various needs of stac+ in 9#A.
PART B
1. <,plain in detail about simplification of -FG.
2. -onstruct a -onte,t free (rammar for the lan(ua(e
L7>a
n
b
n
M nH71?
3. Let G be the (rammar 0 AH a;MbA 2 A AH aMa0MbAA2 ; AH bMb0Ma;; for the strin(
aaabbabbba find a
a? Left most derivation
b?:i(ht most derivation
c? 9arse tree
4. .Let G be the (rammar 0 AH ';M1A2 AAH 'M'0M1AA2 ; AH1M10M';; for the strin(
''11'1'1 find a
a? Left most derivation
b? :i(ht most derivation
c? 9arse tree
. Find the lan(ua(e are (enerated b* the followin( (rammars.
a. 0 AH '01 M 'A12 AAH1AM1
b. 0AH's1M'AM'M1;M12 AAH'AM'2 ;AH1;M1
!. -onstruct a 9#A acceptin( 1 a
n
b
n
N nH713 b* final state with neat e,ample..
". -onstruct a 9#A acceptin( 1 a
n
b2
n
N nH713 b* empt* store.
$. -onstruct a 9#A e5uivalent to the followin( (rammar
0AHAAGa2 AAH0AGb . .est whether abbabb is accepted b* 9#A.
&. nstruct a 9#A acceptin( 1 a
n
b
m
c
m
d
n
where n2m H7 1. 3 b* final state.
1'. -onstruct a 9#A e5uivalent to the followin( (rammar
0AHaA;;GaAA2 AAHa;;Ga2;AHb;;GA .
b? 9rove the theorem2 @f L is L>=2? for some 9#A =22 then L is %>=1? for some
9#A =1.
UNIT IV
PART A
1. Give the importance of -%F.
2. Write the procedure to eliminate production.
3. #etermine whether the (rammar G has a useless production ?
0A2AaAM ,bA
4. List out the operations are involved in -FG to -%F form.
. Write the steps are involved in -FG to G%F form?
!. Give short notes about lemma1 in G%F.
". Give short notes about lemma2 in G%F.
$. Give formal definition of .urin( machine.
&. Write short notes about .urin( machine?
1'. What are the parameters available in transition function of .urin( machine?
11. )ow subroutine is implemented in .urin( machine?
12. Wh* we are usin( multiple trac+s in .urin( machine?
13. Write short notes about two wa* infinite tapes?
14. Give notes about instantaneous description of .=.
1. Write definition of multitape .urin( machine?
1!. #istin(uish finite state machine and .urin( machine.
1". List out the advanta(es in .urin( machines over -FG?
1$. #raw the model for .urin( machine.
1&. Give short notes about unit production.
2'. List out the importance of G%F.
21. )ow .urin( machine wor+s accordin( as transducers.
22. Wh* we are usin( finite control?
23. Write short notes about chec+in( of s*mbols?
24. List out the various elements of .urin( machine? Give the representation of
.urin( machine.
2. )ow .urin( machine wor+s accordin( as acceptors.
PART B
1. -onvert the followin( (rammar in to -%F
0aAa M b;b M
A- M a
;-M b
--#< M
#A M ; Mab
2. -onstruct the G%F (rammar for the followin(.
0AA M a
A 00 M b
3. -onvert the (rammar in to -%F
0a0aA M A
AabAMb
4. -onvert the followin( (rammar in to G%F
0 A;
A;0 M b
;0A M a
. .ransform the (rammar with productions
0abA;
AbA; M
;;Aa M A M in to -%F?
!. #esi(n a .urin( machine to compute the concatenation functions f>n12n2?7n1n2.
". #esi(n a .urin( machine to compute f>,?7,D1.
$. -onstruct a .urin( machine that f>,D*?7,D* perform the (iven addition
operation.
&. -onstruct a .urin( machine to accept the lan(ua(e L71'
n
1
n
G nH713.
1'. -onstruct a .= for Oero function fN %AH%2 f>,?7'.
UNIT V
PART A
1. 0tate :ice theorem.
2. List out the various problems in Pndecidabilit*?
3. Give short notes about universal lan(ua(e.
4. 0tate #ecidabilit*.
. List out some of the undecidable problems.
!. Give short notes about haltin( problem.
". =ention the use of reducibilit*?
$. 0tate :ice theorem.
&. List out the non trivial properties in :ice theorem.
1'. Give e,ample for partial recursive and total recursive functions.
11. #ifferentiate recursive and recursivel* enumerable lan(ua(e.
12. #efine e5uivalence problem.
13. When a problem is said to be decidable? Give e,ample of a decidable problem.
14. )ow universal .urin( machine is differ from .urin( machine?
1. List out the various properties of recursivel* enumerable set that are not
decidable?
1!. List out the various the properties of universal lan(ua(e?
1". )ow the haltin( problem is occurred in .urin( machine?
1$. Give short notes about recursive.
1&. What is the relationship between computabilit* and decidabilit*?
2'. List out some of the decidable problems.
21. Give short notes about recursivel* enumerable lan(ua(e.
22. Give formal definition about phase structure (rammar.
23. Wh* the haltin( problem occurred?
24. Write the various methods are involved for correctin( undecidable problem?
2. List out the various the properties of recursive and recursivel* enumerable
lan(ua(e?
PART B
1. a?. 0how that union of recursive lan(ua(e is recursive.
b?. 0how that if a lan(ua(e L and its complement L/ are both recursivel*
enumerable then L is recursive.
2. 0how that the complement of a recursive lan(ua(e is recursive.
3. 0how that the universal lan(ua(e Lu is not recursive.
4. 0how that Ln is recursivel* enumerable.
. #iscuss in detail about Pniversal .urin( =achine.
!. #efine L
d
and show that L
d
is not recursivel* enumerable.
". For an* recursivel* enumerable lan(ua(e2 it is undecidable to determine whether
L is empt*.
$. <,plain the haltin( problem is undecidable.
&. 0tate whether the totalit* problem is undecidable.
1'. <,plain in detail about <5uivalence problem.