R19 Flat Material

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SIR C R REDDY COLLEGE OF ENGINEERING

Eluru-534007, Andhra Pradesh State, INDIA.
oE
(Affiliated to JNTUK, Kakinada - Approved by AICTE - Accredited by NAAC)
RC
STUDY MATERIAL
CR
FORMAL LANGUAGES AND AUTOMATA THEORY
B.TECH II YEAR - II SEM

(JNTU R19-REGULATION)
Sir
Prepared by
P Naga Deepthi
Assistant Professor
Dept. CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 1

R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India
oE
L T P C
II Year – II Semester
3 0 0 3
FORMAL LANGUAGES AND AUTOMATA THEORY
Course Objectives:
 To learn fundamentals of Regular and Context Free Grammars and Languages
 To understand the relation between Regular Language and Finite Automata and machines
 To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators
 To understand the relation between Contexts free Languages, PDA and TM
 To learn how to design PDA as acceptor and TM as Calculators
RC
Course Outcomes:
By the end of the course students can
 Classify machines by their power to recognize languages.
 Summarize language classes & grammars relationship among them with the help of
Chomsky hierarchy
 Employ finite state machines to solve problems in computing
 Illustrate deterministic and non-deterministic machines
 Quote the hierarchy of problems arising in the computer science
UNIT I
Finite Automata: Need of Automata theory, Central Concepts of Automata Theory, Automation,
Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of DFAs, NFA,
Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata
CR
with Є-Transitions, Minimization of Finite Automata, Finite Automata with output-Mealy and
Moore Machines, Applications and Limitation of Finite Automata.
UNIT II
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of REs,
Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA and RE,
Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars, Classification
of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular Grammars,
Equivalence between RG and FA, Inter Conversion.
UNIT III
Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees,
Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of Useless
Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal Form and
Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context Free
Grammars.
Sir
UNIT IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description,
Language Acceptance of Pushdown Automata, Design of Pushdown Automata, Deterministic and
Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and Context Free
Grammars, Conversion, Two Stack Pushdown Automata, Application of Pushdown Automata.
R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India
oE
UNIT V
Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of TMs,
Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems, Halting
Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and NP, NP-Hard
and NP-Complete Problems.
Text Books:
1) Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R.
Motwani and J. D. Ullman, 3rd Edition, Pearson, 2008
2) Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishra and
RC
N. Chandrasekharan, 3rd Edition, PHI, 2007
Reference Books:
1) Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., Pearson /PHI
2) Theory of Computation, V. Kulkarni, Oxford University Press, 2013
3) Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill, 2014
e-Resources:
1) https://nptel.ac.in/courses/106/104/106104028/
CR
Sir
SHEDULE PLAN
NUMBER OF
SNO DESCRIPTION CLASSES
oE
REQUIRED
Finite Automata: Need of Automata theory, Central
Concepts of Automata Theory, Automation,
Finite Automation, Transition Systems, Acceptance of a
String, DFA, Design of DFAs, NFA,
Design of NFA, Equivalence of DFA and NFA, Conversion
1 14
of NFA into DFA, Finite Automata
with Є-Transitions, Minimization of Finite Automata, Finite
Automata with output-Mealy and
Moore Machines, Applications and Limitation of Finite
RC
Automata.
Regular Expressions, Regular Sets, Identity Rules,
Equivalence of two RE, Manipulations of REs,
Finite Automata and Regular Expressions, Inter Conversion,
Equivalence between FA and RE,
2 Pumping Lemma of Regular Sets, Closure Properties of 10
Regular Sets, Grammars, Classification
of Grammars, Chomsky Hierarchy Theorem, Right and Left
Linear Regular Grammars,
Equivalence between RG and FA, Inter Conversion.
Formal Languages, Context Free Grammar, Leftmost and
Rightmost Derivations, Parse Trees,
CR
Ambiguous Grammars, Simplification of Context Free
Grammars-Elimination of Useless
3 Symbols, Є-Productions and Unit Productions, Normal 12
Forms-Chomsky Normal Form and
Greibach Normal Form, Pumping Lemma, Closure
Properties, Applications of Context Free
Grammars.
Pushdown Automata, Definition, Model, Graphical Notation,
Instantaneous Description,
Language Acceptance of Pushdown Automata, Design of
Pushdown Automata, Deterministic and
4 12
Non – Deterministic Pushdown Automata, Equivalence of
Pushdown Automata and Context Free
Grammars, Conversion, Two Stack Pushdown Automata,
Application of Pushdown Automata.
Sir
Turning Machine: Definition, Model, Representation of

TMs-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a
TM, Design of TMs, Types of TMs,
5 Church’s Thesis, Universal and Restricted TM, Decidable 12
and Un-decidable Problems, Halting
Problem of TMs, Post’s Correspondence Problem, Modified
PCP, Classes of P and NP, NP-Hard
and NP-Complete Problems.

INDEX
oE
S. No Topic Page no
1 Strings, Alphabet, Language, Operations 6-9
2 Finite state machine, 10-15
3 Finite Automata: DFA,NFA,With Є transitions 16-21
8
Conversions and Equivalence :
Finite Automata with output

RC
NFA to DFA conversion, minimization of FSM,equivalence
between two FSMs
Regular Languages: Conversion, Pumping lemma ofregular sets
Pumping lemma of regular sets

22-27
28-32
46-52
53-58
59-64
CR
9 FA:RLG,LLG, Sentential forms 65-72
10 Context Free Grammars: CNF,GNF 73-93

Pumping Lemma for Context Free Languages.Enumeration of
11 properties of CFL 94-107
Equivalence of CFL and PDA, inter conversion PushDown Automata,
12 LBA,CSL 108-112
Turing Machine: Church’s hypothesis, countermachine, types of
13 Turing machines 113-115
14 LR(0) grammar, decidability of, problems ,UTM, Pand NP Problems 116-122

Sir

oE
RC
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

E
R Co
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
Unit-II
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

UNIT-3
oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

UNIT-3
oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

UNIT-4
oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

UNIT-5
oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

oE
RC
CR
Sir

R19 Flat Material

Uploaded by

Copyright:

Available Formats

R19 Flat Material

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

R19 Flat Material

Uploaded by

Copyright:

Available Formats

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SIR C R REDDY COLLEGE OF ENGINEERING

B.TECH II YEAR - II SEM

FORMAL LANGUAGES AND AUTOMATA THEORY Page 1

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Turning Machine: Definition, Model, Representation of

FORMAL LANGUAGES AND AUTOMATA THEORY Page 2

1 Strings, Alphabet, Language, Operations 6-9

2 Finite state machine, 10-15

3 Finite Automata: DFA,NFA,With Є transitions 16-21

Finite Automata with output

Regular Languages: Conversion, Pumping lemma ofregular sets

Pumping lemma of regular sets

10 Context Free Grammars: CNF,GNF 73-93

14 LR(0) grammar, decidability of, problems ,UTM, Pand NP Problems 116-122

FORMAL LANGUAGES AND AUTOMATA THEORY Page 3

FORMAL LANGUAGES AND AUTOMATA THEORY Page 6

FORMAL LANGUAGES AND AUTOMATA THEORY Page 7

FORMAL LANGUAGES AND AUTOMATA THEORY Page 8

FORMAL LANGUAGES AND AUTOMATA THEORY Page 9

FORMAL LANGUAGES AND AUTOMATA THEORY Page 10

FORMAL LANGUAGES AND AUTOMATA THEORY Page 11

FORMAL LANGUAGES AND AUTOMATA THEORY Page 12

FORMAL LANGUAGES AND AUTOMATA THEORY Page 13

FORMAL LANGUAGES AND AUTOMATA THEORY Page 14

FORMAL LANGUAGES AND AUTOMATA THEORY Page 15

FORMAL LANGUAGES AND AUTOMATA THEORY Page 16

FORMAL LANGUAGES AND AUTOMATA THEORY Page 17

FORMAL LANGUAGES AND AUTOMATA THEORY Page 18

FORMAL LANGUAGES AND AUTOMATA THEORY Page 19

FORMAL LANGUAGES AND AUTOMATA THEORY Page 20

FORMAL LANGUAGES AND AUTOMATA THEORY Page 21

FORMAL LANGUAGES AND AUTOMATA THEORY Page 22

FORMAL LANGUAGES AND AUTOMATA THEORY Page 23

FORMAL LANGUAGES AND AUTOMATA THEORY Page 24

FORMAL LANGUAGES AND AUTOMATA THEORY Page 25

FORMAL LANGUAGES AND AUTOMATA THEORY Page 26

FORMAL LANGUAGES AND AUTOMATA THEORY Page 27

FORMAL LANGUAGES AND AUTOMATA THEORY Page 28

FORMAL LANGUAGES AND AUTOMATA THEORY Page 29

FORMAL LANGUAGES AND AUTOMATA THEORY Page 30

FORMAL LANGUAGES AND AUTOMATA THEORY Page 31

FORMAL LANGUAGES AND AUTOMATA THEORY Page 32

FORMAL LANGUAGES AND AUTOMATA THEORY Page 33

FORMAL LANGUAGES AND AUTOMATA THEORY Page 34

FORMAL LANGUAGES AND AUTOMATA THEORY Page 35

FORMAL LANGUAGES AND AUTOMATA THEORY Page 36

FORMAL LANGUAGES AND AUTOMATA THEORY Page 37

FORMAL LANGUAGES AND AUTOMATA THEORY Page 38

FORMAL LANGUAGES AND AUTOMATA THEORY Page 39

FORMAL LANGUAGES AND AUTOMATA THEORY Page 40

FORMAL LANGUAGES AND AUTOMATA THEORY Page 41

FORMAL LANGUAGES AND AUTOMATA THEORY Page 42

FORMAL LANGUAGES AND AUTOMATA THEORY Page 43

FORMAL LANGUAGES AND AUTOMATA THEORY Page 44

FORMAL LANGUAGES AND AUTOMATA THEORY Page 45