28 views

Uploaded by sivabharathamurthy

Attribution Non-Commercial (BY-NC)

- Solutions Peter Linz Automata
- rr310504-theory-of-computation
- r7310501-Formal Languages and Automata Theory
- r05310501 Formal Languages and Automata Theory
- Automata 1
- MC0079 Computer Based Optimization Methods Assignement Feb 11
- r05310501 Formal Languages and Automata Theory
- 08 r05310501 Formal Languages and Automata Theory
- csci3255 HW 3
- r05310501 Formal Languages and Automata Theory
- cs automata
- Solution to Peter Linz
- Solution-Introduction+to+Automata+Theory
- Dfa Assignment
- single-spaced-thesis.pdf
- r7311502-Automata and Compiler Design
- Tutorial 1
- Theory of Computation Notes
- ACD-11..
- parser

You are on page 1of 1

FORMAL LANGUAGES AND AUTOMATA THEORY

(Computer Science & Engineering)

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

?????

(a) On input ‘w’, produce output an , where n is the number of occurrences of the sub string ab in w.

(b) On input ‘w’, produce output an , where n is the number of occurrences of the sub string aba in

w.

2. Construct a NFA, which accepts language L=set of strings with zero (or) more number of 0’s followed

by zero (or) more number of 1’s followed by zero (or) more number of 2’s And construct equivalent

DFA. [16]

3. Consider the two regular expressions

r=0*+1*, s=01*10*+1*0+(0*1)*

(a) Find a string corresponding to r but not to s.

(b) Find a string corresponding to s but not to r. [8+8]

4. Construct Left Linear Grammar and Right Linear grammars for the languages shown below.

(a) (0+1)*00(0+1)*

(b) (((01+10)*11)*00)*. [2×8]

5. Eliminate useless symbols, useless productions, unit productions. And null productions from the

following grammars:

(a) S → aS |A| c

A→a

B → aa

C → acb

(b) S → aa |A| B| C

A → aB |λ

B → Aa

C → aCD

D → ddd. [8+8]

6. (a) Construct the PDA corresponding to the grammar:

S→aABB/aAA

A→aBB/a

B→bBB/A.

(b) Construct a PDA that accepts the language

L = {wcwR /w ∈ {a, b}∗ }. [8+8]

7. (a) Compare and contrast Finite automation, push down automaton and Turing machines.

(b) Design Turing Machine, which multiplies two integers. Give its state transition diagram. [8+8]

8. (a) Give the CSL for L={an bn cn : n >= 1}

(b) Writes the properties of recursive and recursive enumerable languages.

(c) Mention the properties of DCFL’s. [5+6+5]

?????

- Solutions Peter Linz AutomataUploaded byimhungrynow
- rr310504-theory-of-computationUploaded bySRINIVASA RAO GANTA
- r7310501-Formal Languages and Automata TheoryUploaded bysivabharathamurthy
- r05310501 Formal Languages and Automata TheoryUploaded byandhracolleges
- Automata 1Uploaded bywest_lmn
- MC0079 Computer Based Optimization Methods Assignement Feb 11Uploaded byChitra Lekha
- r05310501 Formal Languages and Automata TheoryUploaded bySRINIVASA RAO GANTA
- 08 r05310501 Formal Languages and Automata TheoryUploaded byandhracolleges
- csci3255 HW 3Uploaded byDK Hassan
- r05310501 Formal Languages and Automata TheoryUploaded byMohammed Muzzammil
- cs automataUploaded byimhungrynow
- Solution to Peter LinzUploaded byGinny Chugh
- Solution-Introduction+to+Automata+TheoryUploaded byAzmi Yüksel
- Dfa AssignmentUploaded byAnonymous QQT5IxbV
- single-spaced-thesis.pdfUploaded bysacramus
- r7311502-Automata and Compiler DesignUploaded bysivabharathamurthy
- Tutorial 1Uploaded bySaimo Mghase
- Theory of Computation NotesUploaded byKniturse
- ACD-11..Uploaded byNarahari Kandlakunta
- parserUploaded byalfanrosid
- WAIMLAp2017-OverviewProgram.pdfUploaded byjc224
- III YEAR SLIP TEST QUESTIONS A.docUploaded byarthy1111
- 4 - 1 - 13. Equivalence of PDA's and CFG's (18 Min.)Uploaded byHuong Luong
- Genetic AlgorithmUploaded byssmaths069996
- c03 SyntaxUploaded byBama Raja Segaran
- ExamenUploaded byKenet Martinez
- 14085 Ch 8 Dedidability,Computability,ComplexityUploaded bySheeraz Ahmad
- Print Page - Fiesta 16 _ Fall 2009Uploaded byteachopensource
- v3-67-73Uploaded byyagolain
- SemAnal SummaryUploaded byShaukatWasi

- 9A05707 Software Project ManagementUploaded bysivabharathamurthy
- Control Systems (Cs) Notes as Per JntuaUploaded bysivabharathamurthy
- telugu-first-language.pdfUploaded bysatya
- ssc Social Textbook (AP)Uploaded bysivabharathamurthy
- 9A13701 Robotics and AutomationUploaded bysivabharathamurthy
- 07A4EC01 Environmental StudiesUploaded bysivabharathamurthy
- R7410506 Mobile ComputingUploaded bysivabharathamurthy
- R7410407 Operating SystemsUploaded bysivabharathamurthy
- R5410201 Neural Networks & Fuzzy LogicUploaded bysivabharathamurthy
- R7312301 Transport Phenomena in BioprocessesUploaded bysivabharathamurthy
- R7311506 Operating SystemsUploaded bysivabharathamurthy
- R7311306 Process ControlUploaded bysivabharathamurthy
- R7311205 Distributed DatabasesUploaded bysivabharathamurthy
- R7311006 Process Control InstrumentationUploaded bysivabharathamurthy
- R7310506 Design & Analysis of AlgorithmsUploaded bysivabharathamurthy
- R7310406 Digital CommunicationsUploaded bysivabharathamurthy
- R7310306 Heat TransferUploaded bysivabharathamurthy
- R7310206 Linear Systems AnalysisUploaded bysivabharathamurthy
- R7310106 Engineering GeologyUploaded bysivabharathamurthy
- R5310406 Digital CommunicationsUploaded bysivabharathamurthy
- R5310204 Power ElectronicsUploaded bysivabharathamurthy
- 9A23501 Heat Transfer in BioprocessesUploaded bysivabharathamurthy
- 9A21506 Mechanisms & Mechanical DesignUploaded bysivabharathamurthy
- 9A15502 Digital System DesignUploaded bysivabharathamurthy
- 9A14503 Principles of Machine DesignUploaded bysivabharathamurthy
- 9A10505 Principles of CommunicationsUploaded bysivabharathamurthy
- 9A05505 Operating SystemsUploaded bysivabharathamurthy
- 9A04504 Digital IC ApplicationsUploaded bysivabharathamurthy
- 9A03505 Heat TransferUploaded bysivabharathamurthy
- 9A02505 Electrical Machines-IIIUploaded bysivabharathamurthy

- dec14 question paper vtuUploaded byjohn
- DIF-FFTUploaded byGayathri Rajendran
- Cellular AutomatonUploaded bygerte_yuew
- cs402MidtermSolvedMCQsWithReferencesbyMoaaz(1)Uploaded byGhufran Asif
- A Parameterized Complexity TutorialUploaded bybobysiswanto
- Fft ConvolutionUploaded byPiyush Singh
- Using Genetic Algorithms to Solve NP-Complete ProblemsUploaded byducnghiahic
- Fundamentals of Algorithms-2Uploaded byMilan Antony
- 2010 Year 6 H2 Maths Prelim Exam QP1Uploaded bycjcsucks
- Solution FaUploaded bySer Gutie
- FFTUploaded bystarman222
- PvNPUploaded bysynthVerity
- Math Cert FinalUploaded bysher blas
- FAFLUploaded byHariprasad Mutalikdesai
- m12018Uploaded byAbhimanyuDhawan
- Theory Of ComputationUploaded byHameed Lebbai
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- r05411006-Artificial Neural NetworksUploaded bySRINIVASA RAO GANTA
- JurnalUploaded bySepriann Rahmadi
- Soft ComputingUploaded byVishvesh Upadhyay
- theory-of-computationUploaded bykomalpilla
- 1. FLC_Problems_Solutions.pdfUploaded byneha_gupta_91
- Presentation 1Uploaded byMabiratu Beyene
- Backpropagation AlgorithmUploaded byFernando Gaxiola
- C# Artificial Intelligence (Ai) Programming - A Basic Object Oriented (Oop) Framework for Neural NetworksUploaded byUndibal Alejandro Rivas
- SISO-MIMO Design ExamplesUploaded byLuisGerardoPrieto
- CYK ALGORITHMUploaded byPrashant Singh
- Fuzzy Logic Abstract EmUploaded bychvnrajar
- 00-Artificial_Intelligence.pdfUploaded byArun Kashyap
- Network Architectures.docxUploaded byjosé_mujica_46