DIGITAL NOTES
ON
FORMAL LANGUAGES AND AUTOMATA
THEORY
R20A0507
[Link] II YEAR - II SEM
(2022-23)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
(Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2015 Certified)
Maisammaguda, Dhulapally (Post Via. Hakimpet), Secunderabad – 500100, Telangana State, INDIA.
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
DEPARTMENTOFCOMPUTER SCIENCE AND ENGINEERING
II Year [Link] CSE II Sem L T /P/D C
4 -/-/- 3
(R20A0507)FORMAL LANGUAGES AND AUTOMATA THEORY
Objectives:
To teach the student to identify different formal language classes and their
relationships
To teach the student the theoretical foundation for designing compilers.
To teach the student to use the ability of applying logical skills.
Teach the student to prove or disprove theorems in automata theory using its
properties
To teach the student the techniques for information processing.
Understand the theory behind engineering applications.
UNIT I:
Fundamentals: Strings, Alphabet, Language, Operations, Finite state machine, definitions,
finite automaton model, acceptance of strings, and languages, FA, transition diagrams and
Language recognizers.
Finite Automata: Deterministic finite automaton, Non deterministic finite automaton and
NFA with Є transitions - Significance, acceptance of languages. Conversions and
Equivalence : Equivalence between NFA with and without Є transitions, NFA to DFA
conversion, minimization of FSM, equivalence between two FSMs, Finite Automata with
output- Moore and Melay machines.
UNIT II:
Regular Languages: Regular sets, regular expressions, identity rules, Conversion finite
Automata for a given regular expressions, Conversion of Finite Automata to Regular
expressions. Pumping lemma of regular sets, closure properties of regular sets .
UNIT III:
Grammar Formalism: Regular grammars-right linear and left linear grammars, equivalence
between regular linear grammar and FA, inter conversion, Context free grammar, derivation
trees, sentential forms. Right most and leftmost derivation of strings.
UNIT IV:
Optimization and Normalization:Ambiguity in context free grammars. Minimization of Context
Free Grammars. Chomsky normal form, Greibach normal form, Pumping Lemma for Context
Free Languages. Enumeration of properties of CFL (proofs omitted).
Push Down Automata: Push down automata, definition, model, acceptance of CFL,
Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of
CFL and PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA.
Context Sensitive Grammars,LINEAR BOUNDED AUTOMATA(Definitions.)
UNIT V:
Turing Machine: Turing Machine, definition, model, design of TM, Computable functions,
recursively enumerable languages. Church’s hypothesis, counter machine, types of Turing
machines (proofs not required).
Computability Theory: Chomsky hierarchy of languages, linear bounded automata and
context sensitive language, LR(0) grammar, decidability of, problems, Universal Turing
Machine, undecidability of posts. Correspondence problem, Turing reducibility, Definition of
P and NP problems, NP complete and NP hard problems.
TEXT BOOKS:
1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and
Ullman J. D. Pearson Education.
2. Introduction to Theory of Computation - Sipser 2nd edition Thomson
REFERENCE BOOKS:
1. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
2. Introduction to languages and the Theory of Computation ,John C Martin, TMH
3. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson /PHI.
4. Theory of Computer Science and Automata languages and computation -Mishra and
Chandrashekaran, 2nd edition, PHI.
5. Theory of Computation, By K.V.N. Sunitha and [Link]
Course Outcomes:
Student will have the ability to
Apply knowledge in designing or enhancing compilers.
Design grammars and automata (recognizers) for different language classes.
Apply knowledge in developing tools for language processing or text processing.
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY
INDEX
S. No Topic Page no
Unit
1 Strings, Alphabet, Language, Operations 6-9
2 Finite state machine, 10-15
3 Finite Automata: DFA,NFA,With Є transitions 16-21
I
4 Conversions and Equivalence : 22-27
NFA to DFA conversion, minimization of FSM, 28-32
5
equivalence between two FSMs
6 Finite Automata with output 46-52
II Regular Languages: Conversion, Pumping lemma of
7 53-58
regular sets
8 Pumping lemma of regular sets 59-64
9 FA:RLG,LLG, Sentential forms 65-72
10 Context Free Grammars:CNF,GNF 73-93
III
Pumping Lemma for Context Free Languages. 94-107
11
Enumeration of properties of CFL
Equivalence of CFL and PDA, inter conversion Push
12 IV 108-112
Down Automata, LBA,CSL
Turing Machine: Church’s hypothesis, counter
13 113-115
machine, types of Turing machines
V
LR(0) grammar, decidability of, problems,UTM,P 116-122
14
and NP Problems
FLAT A.Y 2022-23
UNIT-1
DEPARTMENT OF CSE Page 1
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 2
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 3
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 4
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 5
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 6
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 7
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 8
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 9
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 10
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 11
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 12
FLAT A.Y 2022-23
DEPARTMENT OF CSE Page 13
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 14
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 15
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 16
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 17
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 18
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 19
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 20
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 21
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 22
MRCET CSE
Unit-II
FORMAL LANGUAGES AND AUTOMATA THEORY Page 23
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 24
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 25
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 26
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 27
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 28
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 29
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 30
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 31
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 32
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 33
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 34
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 35
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 36
MRCET CSE
UNIT-3
FORMAL LANGUAGES AND AUTOMATA THEORY Page 43
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 44
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 45
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 46
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 47
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 49
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 50
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 51
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 52
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 53
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 54
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 55
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 56
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 57
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 58
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 59
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 60
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 61
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 62
MRCET CSE
UNIT-4
FORMAL LANGUAGES AND AUTOMATA THEORY Page 64
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 65
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 66
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 67
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 68
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 69
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 70
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 71
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 72
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 73
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 74
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 75
MRCET CSE
UNIT-5
FORMAL LANGUAGES AND AUTOMATA THEORY Page 77
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 78
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 79
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 80
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 81
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 82
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 83
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 84
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 85
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 86
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 87
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 88
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 89
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 90
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 91
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 92
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 93
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 94
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 95
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 96
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 97
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 98
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 99
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 100
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 101
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 102
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 103
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 104
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 105
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 106
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 107
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 108
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 109
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 110
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 111
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 112
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 113
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 114
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 115
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 116
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 117
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 118
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 119
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 120
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 121
MRCET CSE
FORMAL LANGUAGES AND AUTOMATA THEORY Page 122
