1.5K views

Uploaded by Srinivasa Rao G

save

- Scheme and Syllabi for Fifth Semester CSE
- 02 Lexical Analysis Part 1
- State Machine
- CS1303 Theory of Computation Lessonplan
- CS1303_Theory_of_computation
- Cs2303 Theory of Computation 2marks
- ECSE 323 - Tic Tac Toe Game on FPGA Board - Report
- B[1].TechCSE-IIYEAR.R10Students
- Formal Languages and Automata Theory
- 4regexp_grammars
- Lecture 01
- Theory of Computation
- Theory Of Computation
- rr310504-theory-of-computation
- Automata Theory Tutorial 2
- Automata Parsing Appp
- Applied Rec gct
- Tutorial State Machines
- CFG-CNF
- Lecture1 - Overview of Compiler
- MELJUN CORTES Automata Lecture Non-context-free Languages 1
- State Machine
- Bsc Sp Seminar Re
- ca_lec_2
- Final
- Book1ssssssssss
- Context-free Grammar
- Course Notes on SPL
- Segmentation of Document Using Discriminative Context-free Grammar Inference and Alignment Similarities
- Automata.pdf
- 70+Juegos+para+Dinamica+de+Grupos.pdf
- Fa.docx
- _Teoria_Electromagnetica.docx
- LAB-1-MAQUINAS-ELECTRICAS (1)
- Limón de Pica
- (2)Camprubi.pdf
- ADVANCE PowerPoint Slide Show Template Using Morph Feature - PowerPoint Tutorial and Download
- 购买英国本科硕士文凭/办理英国剑桥大学毕业证成绩单Q/微：936794295、咨询办理剑桥大学教育部学历认证、使馆留学生回国人员证明、在读证明、精仿1:1文凭购购买Plymouth University
- Argumentación - marco teórico.doc
- leopol
- KUPON DAGING YAYASAN ALKHAIRAT.docx
- UU_no_20_th_2003.pdf
- Practica n°1 -Mediciones y errores - copia
- III.1.15.3
- Materi Kotor Bencana Pak Maridi
- Ponte en Forma Sin Perder Tiempo Word Scop
- Laboratorio 2 Fisica II - JLG
- 2018.05 Adana Kubravakıa
- An´alisis+est´atico+de+estructuras+por+el+m´etodo+matricial.pdf
- 52420843-Agilent-Cool-On-Column-Operation-Manual.pdf
- Hublot's MIL to Exclude Their Own Financials
- Hsil Survei Kepuasan Maret 16
- 2018
- kikiduyulabmi
- Panduan Ringkas PKM 2015
- 1559-3805-1-SM.pdf
- RIESGOS AMENAZAS Y VULNERABILIDADES DE LOS SISTEMAS DE INFORMACION GEOGRAFICA GPS.pdf
- QWSA
- Belly Dance as a Means of Dance Therapy
- AD2017 Mec Tareas
- 43-Mca-Or-Design and Analysis of Algorithm
- r5 401 Mba Strategic Management Set1
- Rr322305 Immunology
- r05320205 Switchgear and Protection
- r05320305 Design of Machine Members II
- r5 402 Mba Management of Technology Set1
- 41 Mca Nr Software Engineering
- r5 401 Mba Strategic Management Set1
- r6 43 Mca Data Warehousing and Mining Set1
- 41 Mca or Software Engineering
- 41 Mca Nr Software Engineering
- r05320403 Microwave Engineering
- 42 Mca Nr Programming in Java
- r6 42 Mca Advanced Java Programming Set1
- 43-Mca-Or-Design and Analysis of Algorithm
- r5 408 Mba Decision Support Systems Set1
- Nr 305 Mba Retailing Management Set1
- r5 410 Mba Management of Change Set1
- Or 34 Mca Management Information Systems
- Nr 31 Mca Database Management Systems
- Nr 302 Mba Cost and Management Accounting Set1
- r5 304 Mba Enterprise Resource Planning
- r5 305 Mba Retailing Management Set1
- Nr-35-Mca-Design and Analysis of Algorithm
- r6 47 Mca Distributed Operating Systems Set1
- Or 32 Mcacomputer Communication Networks
- r6 34 Mca Management Information Systems Set1
- r6 43 Mca Data Warehousing and Mining Set1
- r6 33 Mca Unix Networks Programming Set1
- r6 48 Mca Mobile Computing Set1

You are on page 1of 9

Code No.310504 III B.Tech. I-Semester Regular Examinations, November-2003 THEORY OF COMPUTATION (Common to Computer Science and Engineering, Computer Science and Systems Engineering and Computer Science and Information Technology) Time: 3 hours Max.Marks:80 Answer any FIVE questions All questions carry equal marks --1.

1

Define NFA mathematically. Explain its significance and function. Convert the given Finite automaton into its Determinstic. Explain the method used. Taking suitable example prove both accept the same strings.

2.a) b)

Define NFA-E transitions and write the differences between NFA-E and ordinary NFA. Find NFA without E for the following

c)

Construct state transition table for the following Moore machine.

(Contd…2)

Code No.310504 3.a) b)

-2-

Set No.1

Give the recursive definition for regular expression and prove every regular expression can be represented by an NFA with epsilon transitions. Construct the regular expression accepted by following finite automaton.

4.a) b)

Construct regular grammar G generating the regular set a* b(a+b)*. Define CFG and give examples. What is CFL generated by the grammar

S → abB, A → aaBb, B → bbAa, A → E

5.a)

b) 6.a) b) 7.a) b)

Design a PDA which accepts all strings there can be derived from the following Grammar. Taking a suitable example verify the machine. S aB/bA A a/aS/bAA B b/bS/aBB Prove that acceptance by empty stack and by final state is equivalent. What is delta of a Turing Machine, explain functions involved in a move of Turing Machines in detail. Design Turing Machine to accept even palindromes derived from the input {a,b}. Give its Transition table and diagram also. Discuss the Chomsky hierarchy of languages,. For the grammar shown below constant the sets of LR(0) items. S' → S $ S → aSb|ab What is decidability? Explain any two undecidable problems. Show that the following post correspondence problem has a solution and give the solution. List A List B i Wi Xi 1 11 111 2 100 001 3 111 11 *** *** ***

8.a) b)

Set No.

Code No.310504 III B.Tech. I-Semester Regular Examinations, November-2003 THEORY OF COMPUTATION (Common to Computer Science and Engineering, Computer Science and Systems Engineering and Computer Science and Information Technology) Time: 3 hours Max.Marks:80 Answer any FIVE questions All questions carry equal marks --1.

2

Define NFA mathematically. Explain its significance and function. Convert the given Finite automaton into its Determinstic. Explain the method used. Taking suitable example prove both accept the same string.

2.a)

Define epsilon closure – Find epsilon closures fo all the states of given NFA-E. Remove epsilons with out changing the acceptance.

b)

Construct Moore machine equivalent to the mealy machine described below. qi q1 q2 q3 q4 qi+1 q1 q4 q2 q3 a=0 output 1 1 1 0 a=1 qi+1 Output q2 0 q4 1 q3 1 q1 1

(Contd…2)

Code No.310504 3.a) b)

-2-

Set No.2

Construct Finite automaton to accept the regular expression (0+1)* (00+11) (0+1)*. Find the regular expression accepted by following deterministic Finite automaton.

4.a) b)

Construct a Finite automata recognizing the following regular grammar. S→ aS / bA / b A→ aA / bS / a Generate CFG for the language L = a nb m : n ≠ m

{

}

5.a)

b) 6.a) b) 7.a) b)

Convert the following grammar into Chomsky Normal Form S aA/a/B/C A aB/E B aA C cCD D abd Give CFG for generating sets of even palindromes over the string {a, b}. Explain the ID and Move of a Turing Machine. Indicate the major differences between Turing Machine and Push down Automation. Design Turing Machine to accept the language L = {0n 1m 2m+n/n≥0, m≥1}. Describe the Linear Bounded automaton and the language it accepts. Is the following grammar LR(0) S' → S S → aSa|bSb|c Briefly describe Universal Turing Machine. Let ε = {0,1} and A and B be lists of three strings each as given below. Is post correspondence problem has a solutions if so give the solution. List A List B i Wi Xi 1 1 11 2 10111 10 3 10 0 *** *** ***

8.a) b)

Set No.

Code No.310504 III B.Tech. I-Semester Regular Examinations, November-2003 THEORY OF COMPUTATION (Common to Computer Science and Engineering, Computer Science and Systems Engineering and Computer Science and Information Technology) Time: 3 hours Max.Marks:80 Answer any FIVE questions All questions carry equal marks --1.

3

Define NFA mathematically. Explain its significance and function. Convert the given Finite automaton into its Determinstic equivalent. Explain the method used. Taking suitable example prove both accept the same strings.

2.a)

Explain the procedure to convert NFA-E to ordinary NFA, and apply the same for the following figure.

b) 3.a) b)

Design Moore and Mealy machines which converts a ternary number into Residue Modulo 5. Prove or disprove the following for Regular expression r and s. (i) (rs+r)*r = r(sr + r)* (ii) (r* s*)* = (r+s)* Find the regular expression accepted by following automaton.

(Contd…2) Code No.310504 -2Set No.3

4.a) b)

Construct finite automata recognizing the following grammar. A0→aA1 A1 → bA1 / b Ao / a Describe the language generated by the grammar S → aAB, A → bBb, B → A /^ Give the rigorous definition for a derivation tree and give an example. Construct Push Down Automata equivalent to the grammar and verify the result for aabaaa. S aAA A aS/bS/a Prove or explain that if L is a Context Free Language then there exists an equivalent Push Down Automata. Compare and contrast Finite automaton, push down Automaton and Turing Machines. Design Turing Machine which multiplies two integers. Give its state Transition diagram also. Define the ‘Handler’ for the derivation aabb find the viable prefixes of the grammar shown below. S' → S S → aSb|ab When an item is said to be complete, find the sets of LR(0) items. Explain the Turing reducibility in detail. What is post correspondence problem? Is there any solution for the following PCP problem? If so give the solution if not discuss why? i 1 2 3 List A List B Wi Xi 00 0 001 11 1000 011 *** ***

5.a)

b) 6.a) b)

7.a)

b) 8.a) b)

***

Set No.

Code No.310504 III B.Tech. I-Semester Regular Examinations, November-2003 THEORY OF COMPUTATION (Common to Computer Science and Engineering, Computer Science and Systems Engineering and Computer Science and Information Technology) Time: 3 hours Max.Marks:80 Answer any FIVE questions All questions carry equal marks --1.

4

Define NFA mathematically. Explain its significance and functioning. Convert the given Finite automation into its Determinstic equivalent. Explain method used. Taking suitable example prove both accept the same string.

2.a)

Construct DFA for the NFA-E shown below.

b)

Construct a Mealy machine equivalent to the Moore machine given by the following table. a=0 a=1 Output qi+1 qi+1 q0 q1 q2 1 q1 q3 q2 0 q2 q2 q1 1 q3 q0 q3 1

(Contd…2)

Code No.310504 3. a) b)

2

-2-

Set No.4

Show that the set Show that the set {a i / i ≥ 1} is not regular. Consider the FA given construct a regular expression that is accepted by it.

4.a)

b) 5.a)

Construct a DFA to accept the language generated by the language. S → 01 A A → 10 B B → 0A/11. What is meant by ambiguous grammar? Test whether the grammar is ambiguous or not. S → SS / a / b Convert the following grammar into CNF E → E + T/T T → a/(E) Convert the following to GNF S → AB A → BS/b B → SA/a Briefly explain the properties of recussive enumerable languages. Design Turing Machine to recognize the palindromes of digits {0,1}. Give its state transition diagram also. Construct LR(0) items for the grammar given, find its equivalent DFA. Check the parsing by taking a suitable derived string. S' → S S → AS|λ A → aA|b λ is null What do you mean by ‘reduction’? Explain the Turing reducability. Find the solution for PCP problem given below List A List B i Wi Xi 1 a aaa 2 abaaa ab 3 ab b

b)

6.a) b) 7.

8.a) b)

***

***

***

- Scheme and Syllabi for Fifth Semester CSEUploaded byAnoop K Venu
- 02 Lexical Analysis Part 1Uploaded bykalai
- State MachineUploaded byluffydmon
- CS1303 Theory of Computation LessonplanUploaded bykrishna4_1999_269710
- CS1303_Theory_of_computationUploaded byLavanya Devaraj
- Cs2303 Theory of Computation 2marksUploaded byShanmugasundaram Muthuswamy
- ECSE 323 - Tic Tac Toe Game on FPGA Board - ReportUploaded bypiohm
- B[1].TechCSE-IIYEAR.R10StudentsUploaded byvitcse2010
- Formal Languages and Automata TheoryUploaded byNathan Samuel Obinwafor Uzoma
- 4regexp_grammarsUploaded byAryan Agarwall
- Lecture 01Uploaded byYounus Shah
- Theory of ComputationUploaded bySatish Dabhade
- Theory Of ComputationUploaded byHameed Lebbai
- rr310504-theory-of-computationUploaded bySRINIVASA RAO GANTA
- Automata Theory Tutorial 2Uploaded byJims Destor
- Automata Parsing ApppUploaded bySiraj Ud-Doulla
- Applied Rec gctUploaded byHarish Mahendira Singh
- Tutorial State MachinesUploaded byLaurMatei
- CFG-CNFUploaded byBiju Joseph
- Lecture1 - Overview of CompilerUploaded byv_n79
- MELJUN CORTES Automata Lecture Non-context-free Languages 1Uploaded byMELJUN CORTES, MBA,MPA
- State MachineUploaded bydjun033
- Bsc Sp Seminar ReUploaded byDilhani de Silva
- ca_lec_2Uploaded bySaeed Rehman
- FinalUploaded byJohn Cesar
- Book1ssssssssssUploaded byPhạm Nguyễn
- Context-free GrammarUploaded bySojharo Mangi
- Course Notes on SPLUploaded byGeoseun Noa Gyojeon
- Segmentation of Document Using Discriminative Context-free Grammar Inference and Alignment SimilaritiesUploaded byEditor IJRITCC
- Automata.pdfUploaded byTony

- 43-Mca-Or-Design and Analysis of AlgorithmUploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1Uploaded bySrinivasa Rao G
- Rr322305 ImmunologyUploaded bySrinivasa Rao G
- r05320205 Switchgear and ProtectionUploaded bySrinivasa Rao G
- r05320305 Design of Machine Members IIUploaded bySrinivasa Rao G
- r5 402 Mba Management of Technology Set1Uploaded bySrinivasa Rao G
- 41 Mca Nr Software EngineeringUploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1Uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1Uploaded bySrinivasa Rao G
- 41 Mca or Software EngineeringUploaded bySrinivasa Rao G
- 41 Mca Nr Software EngineeringUploaded bySrinivasa Rao G
- r05320403 Microwave EngineeringUploaded bySrinivasa Rao G
- 42 Mca Nr Programming in JavaUploaded bySrinivasa Rao G
- r6 42 Mca Advanced Java Programming Set1Uploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of AlgorithmUploaded bySrinivasa Rao G
- r5 408 Mba Decision Support Systems Set1Uploaded bySrinivasa Rao G
- Nr 305 Mba Retailing Management Set1Uploaded bySrinivasa Rao G
- r5 410 Mba Management of Change Set1Uploaded bySrinivasa Rao G
- Or 34 Mca Management Information SystemsUploaded bySrinivasa Rao G
- Nr 31 Mca Database Management SystemsUploaded bySrinivasa Rao G
- Nr 302 Mba Cost and Management Accounting Set1Uploaded bySrinivasa Rao G
- r5 304 Mba Enterprise Resource PlanningUploaded bySrinivasa Rao G
- r5 305 Mba Retailing Management Set1Uploaded bySrinivasa Rao G
- Nr-35-Mca-Design and Analysis of AlgorithmUploaded bySrinivasa Rao G
- r6 47 Mca Distributed Operating Systems Set1Uploaded bySrinivasa Rao G
- Or 32 Mcacomputer Communication NetworksUploaded bySrinivasa Rao G
- r6 34 Mca Management Information Systems Set1Uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1Uploaded bySrinivasa Rao G
- r6 33 Mca Unix Networks Programming Set1Uploaded bySrinivasa Rao G
- r6 48 Mca Mobile Computing Set1Uploaded bySrinivasa Rao G