Scribd
Upload
45 views3 pages

Theory of Computation: Vignan University:: Vadlamudi - 522 213

This document contains 5 units related to the theory of computation: 1. Defines a finite state automaton and asks questions related to closure properties and strings accepted. 2. Discusses closure properties of regular languages and regular expressions. 3. Defines context-free grammars and asks questions related to properties of context-free languages. 4. Defines non-deterministic and deterministic pushdown automata and constructs a PDA. 5. Briefly discusses Turing machines and Church's thesis, and constructs a TM for a specific language.

Uploaded by

ranga231980
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
45 views3 pages

Theory of Computation: Vignan University:: Vadlamudi - 522 213

This document contains 5 units related to the theory of computation: 1. Defines a finite state automaton and asks questions related to closure properties and strings accepted. 2. Discusses closure properties of regular languages and regular expressions. 3. Defines context-free grammars and asks questions related to properties of context-free languages. 4. Defines non-deterministic and deterministic pushdown automata and constructs a PDA. 5. Briefly discusses Turing machines and Church's thesis, and constructs a TM for a specific language.

Uploaded by

ranga231980
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Regulation : R09/R10

Code No: CS305

VIGNAN UNIVERSITY :: VAD A!UDI " 5## #13


Vignans Foundation for Science, Technology and Research (Estd. U/s 3 of UG !ct of "#$%&

''' (.Tech ' Se)ester Regular E*a)ination, +ece),er -."-

T$E%RY %& C%!'UTATI%N


( SE& Ti)e/ 3 hours In)t*u+tion): 1, An)-e* %NE .ue)tion /*o0 ea+1 unit #, All 2ue)tion) +a**3 e.ual 0a*4) 3, A))u0e 0i))ing data5 i/ an3 666 0a*. 0ar1s / (0

UNIT 7 I
". onsider the follo2ing

3 4F!.
b {q } {r} c {r} {p}

q *r p {p } {q }

a {p } {q } {r}

-.

a& o)5ute the 3 closure of each state. ,& Gi9e all the strings of length three (or& less acce5ted ,y the auto)aton. c& on9ert the auto)aton to a +F!. 8%R9 State and 5ro9e 0yhill34eroche Theore).

6708 6708 6708 6"-08

UNIT 7 II 3. a& :rite closure 5ro5erties of regular languages. 6%08 ,& :rite regular e*5ression for the follo2ing language ;set of strings o9er al5ha,et <a, ,, c= containing at least one a and at least one ,>. 6%08
8%R9

7.

a& Find regular gra))ar for the language ? @ < an ,)/n A ) is e9en=. ,& Sho2 that ? @ < z n / n "= is not regular.

6%08 6%08

UNIT 7 III $. a& Gi9e conte*t free gra))ar for the language ? @ <ai ,B 1/ i B (or& i 1= ,& Gi9e the decision 5ro5erties of onte*t Free ?anguages ( F?S&. %. 8%R9 onsider the gra))ar. S a ! a D ,(, D ! Da ( D, +E D + ! D ( D a, a& !re there any useless sy),ols. Eli)inate the) if so.
" of -

6C08 6708 6"-08

6708

Regulation : R09/R10

,& Eli)inate 3 5roductions. c& Eli)inate unit E 5roductions.

Code No: CS305

6708 6708

- of -

Regulation : R09/R10

Code No: CS305

UNIT 7 IV F. a& Gi9e the definition of Gush +o2n !uto)ata(G+!& and difference ,et2een non deter)inistic G+! and deter)inistic G+!. 6708 ,& onstruct G+! for the language. 6C08 ?@

{ ww / w <a,b,c=H}
R

:here 2R is re9erse of 2

C.

Sho2 that the language ? @


free language.

<w / w <a, b= H and n (2& n (2&= is a deter)inistic conte*t


a ,

8%R9

6"-08

:here na(2& is nu),er of as in 2 n,(2& is nu),er of ,s in 2. UNIT 7 V #. a& (riefly e*5lain a,out Uni9ersal Turing 0achine ,& (riefly discuss churchs thesis. 8%R9 ".. 6%08 6%08

Gi9e the definition of Turing 0achine (T0& and construct T0 for the language. 6"-08 ? @ {. i "i -i / i .}

3 of -

You might also like