Scribd
Upload
23 views

Gujarat Technological University: W.E.F. AY 2018-19

Uploaded by

diyab6804
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Gujarat Technological University: W.E.F. AY 2018-19

Uploaded by

diyab6804
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

GUJARAT TECHNOLOGICAL UNIVERSITY

Bachelor of Engineering
Subject Code: 3151605
Semester – V
Subject Name: Formal Language and Automata Theory

Type of Course: NA

Prerequisite:Knowledge in mathematics, including a course in discrete mathematics, and in programming.

Rationale:To introduce students the basic concepts in theoretical computer science, and the formal
relationships among machines, languages and grammars and computational problems.The course should in
addition clarify the practical view towards the applications of these ideas in engineering.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total


L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Hours %


No. Weightage

1 Introduction to Finite Automata: Introduction to Finite Automata, 9 19


Central Concepts of Automata Theory, Deterministic Finite Automata
(DFA), Nondeterministic Finite Automata (NFA), Finite Automata with
Epsilon Transition.
2 Regular Expressions and Languages: Regular Expressions, Finite 6 12
Automata and Regular Expressions, Applications of Regular
Expressions, Proving Languages Not to Be Regular, Closure Properties
of Regular Languages, Equivalence and Minimization of Automata –
Pumping Lemma.
3 Context Free Grammars and Languages Parse Trees:Applications of 9 19
Context Free Grammars, Ambiguity in Grammars and Languages,
Eliminating Useless Symbols, Computing the Generating and Reachable
Symbols, Eliminating Epsilon Productions, Eliminating Unit
Productions, BacosNaur Form (BNF), Chomsky Normal Form (CNF).
4 Pushdown Automata, CFL and NCFL: Definition of the Pushdown 9 19
Automaton (PDA), The Languages of a PDA, Equivalence of PDA’s and
CFG’s,Deterministic Pushdown Automata , The Pumping Lemma for
Context Free Languages , Closure Properties of Context Free Languages,
Pumping lemma for CFL, Intersections and Complements of CFL, Non-
CFL

5 Turing Machine (TM): Problems That Computers Cannot Solve, The 9 19

Page 1 of 3

w.e.f. AY 2018-19
GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3151605
Turing Machine, Programming Techniques for Turing Machines
,Extensions to the Basic Turing Machine, Restricted Turing Machines ,
Turing Machines and Computers , Definition of Post’s Correspondence
Problem, A Language That Is Not Recursively Enumerable, An
Undecidable Problem That Is RE, Context sensitive languages and
Chomsky hierarchy, Other Undecidable Problems

6 Computable Functions: Partial, total, constant functions, Primitive 6 12


Recursive Functions, Bounded Mineralization, Regular function,
Recursive Functions

Course outcomes:Students will be able to

Sr. CO Statement Marks %


No. weightage

1. Apply the knowledge of automata theory, grammars & regular expressions for 25
solving the problem

2. Analyse the give automata, regular expression & grammar to know the 20
language it represents

3. Design Automata & Grammar for pattern recognition and syntax checking 25

4. To distinguish between decidability and undecidability of problems 15

5. Identify limitations of some computational models and possible methods of 15


proving them

Suggested Specification table with Marks (Theory): (For BE only)


Distribution of Theory Marks
R Level U Level A Level N Level E Level C Level

10 30 20 20 15 5

Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E:


Evaluate C: Create and above Levels (Revised Bloom’s Taxonomy)

Text and References


1. Automata Theory, Languages, and Computation By John Hopcroft, Rajeev Motowani, and Jeffrey
Ullman
2. Elements of the Theory of Computation,Harry R. Lewis and Christos H. Papadimitriou, Pearson
Education Asia.
3. Introduction to the Theory of Computation By Michael Sipser, Thomson Course Technology
Page 2 of 3

w.e.f. AY 2018-19
GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3151605
4. Introduction to Languages and Automata Theory By John C Martin, Tata McGraw-Hill
5. An introduction to automata theory and formal languages By Adesh K. Pandey, Publisher: S. K.
Kataria& Sons
6. Introduction to computer theory By Deniel I. Cohen , Joh Wiley & Sons, Inc
7. Computation: Finite and Infinite By Marvin L. Minsky Prentice-Hall
8. Compiler Design By Alfred V Aho, Addison Weslley

List of Practical:
JFLAP is recommended for the design of practicals..

List of Open Source Software/learning website:


1. http://en.wikipedia.org/wiki/Theory_of_computation
2. http://meru.cecs.missouri.edu/courses/cecs341/tc.html
3. https://www.coursera.org/courses?query= theory%20of%20computation
4. nptel.ac.in/courses/106104028/theory of computation.
5. https://lagunita.stanford.edu/courses/course-v1:ComputerScience+Automata+SelfPaced/about

Page 3 of 3

w.e.f. AY 2018-19

You might also like