Scribd
Upload
22 views4 pages

Theory Computation Aug Sep2023

Uploaded by

hypertaker04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views4 pages

Theory Computation Aug Sep2023

Uploaded by

hypertaker04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

r lllllll lllll lllllllll lllll llll llll

cB - 480
4o
VlSemesterB.C.A.Examinhtion,August/September2a2S
(CBCS) (F+R) (2016-17 and Onwards)
COMPUTER SCIENCE
BCA 601 : TheorY of ComPutation
Max. Marks : 100
Time : 3 Hours >/
;:r
{"1-<al

Yo

Instruction : Answer all Sections'

SEGTION _ A
Ur@
Answeranytenquestions,Eachquestioncarriestwomarks-(10x2=20)
the tuple'
1. Define finite automata and write

2. Define E-closure of a state'

3. What is traP state ?

4.DefineaR.E.forthelanguagecontaining0,sandl'sendingwith001.
grammar'
5. Mention the ditferent types of

6. State Arden's theorem'

T.Whatisparsing?Nametwotypeso{parsing.

L Define GNF'
#r
(PCP) of turing machine'
9. State Post Correspondence Problem

10. Define nullabe variable'

11. What is lett recursion ?


machine'
12. Name ditferent types of turing

P.T.O.
cB - 480 -2- I lllil lllil lill illil fiil ilt lllt

SECTION - B

Answer any five questions. Each question carries 5 marks. (5x5=25)

13. Design a DFA that accepts strings of a's and b's ending with ab.

14. Check the given grammar is ambiguous.

S -+ 0S1Sl1SOSle

15. Design a € -NFA for the regular expression (00. + 1).

16. Differentiate among DFA, NFA, e- NFA.

17. Reduce the grammar into CNF


S -+ aAD

A -+ aBlbAB

B+b
D-+d

18. Explain Chomsky Hierarchy of grammars.

19. Write down the left most, right most derivation of the given grammar for the
string abbbb using the productions.
'{':

S -+ aAB
A+bBb
B + Ale.

20. Construct the PDA to accept the language L(M) * iw c wRlw e (a+b).i where
wH is reverse of w.
illlililililIillilIlllililtiltilil cB - 480
SECTION -C
Answer any three questions. Each question carries 15 marks. (3x15=45)
21. Construct a DFA from the given
oiven e-NFA. 15

22. Minimize the DFA. 15

A B E
B c F
*Q D H
D E H
E F I

*f G B
G H B
H I C
*l A E

23. a) Eliminate useless symbols from the given grammar. 7


S+A11B111A
S + ABl11
A-+0 "'i

B+BB
b) Eliminate unit productions. I
S+AB
A-+a
B+C
B-+b
C-rD
D-+E
E-+a
cB - 480 .4. llllllllllllllillllllllllllllllllll

' 24. Construct a TM to accept the language. 15

L(M) = {0n 1n ln > 1}

25. Converl the given CFG to GNF. 15

S-+AB
A -+ BSB

A+a
B-+b

SECTION _ D

Answer any one. Each carries 10 marks (111Q=10)

26. Construct a DFA which accepts even number of a's and even number of b's.
27. Using pumping Lemma prove that the language 1 = lanbnln > 0) is not regular.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy