Formal Languages Automata Thery.pdf

FORMAL LANGUAGES AND AUTOMATA THEORY Page 1
DIGITAL NOTES
ON
FORMAL LANGUAGES AND AUTOMATA
THEORY
B.TECH II YEAR - II SEM
(2017-18)
DEPARTMENT OF INFORMATION TECHNOLOGY
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.

II Year B.Tech IT – II Sem L T /P/D C
4 -/-/- 3
(R15A0506)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 (proofs not
required).
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.
Context Free Grammars: Ambiguity in context free grammars. Minimisation of Context
Free Grammars. Chomsky normal form, Greibach normal form, Pumping Lemma for Context
Free Languages. Enumeration of properties of CFL (proofs omitted).
UNIT IV:

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.
LINEAR BOUNDED AUTOMATA(LBA):LBA,context sensitive grammars ,CS languages
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 N.Kalyani
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.

INDEX
S. No
Unit
Topic Page no
1
I
Strings, Alphabet, Language, Operations 6-9
2 Finite state machine, 10-15
3 Finite Automata: DFA,NFA,With Є transitions 16-21
4 Conversions and Equivalence : 22-27
5
NFA to DFA conversion, minimization of FSM,
equivalence between two FSMs
28-32
6 Finite Automata with output 46-52
7
II Regular Languages: Conversion, Pumping lemma of
regular sets
53-58
8 Pumping lemma of regular sets 59-64
9 FA:RLG,LLG, Sentential forms 65-72
10
III
Context Free Grammars:CNF,GNF 73-93
11
Pumping Lemma for Context Free Languages.
Enumeration of properties of CFL
94-107
12 IV
Equivalence of CFL and PDA, inter conversion Push
Down Automata, LBA,CSL
108-112
13
V
Turing Machine: Church’s hypothesis, counter
machine, types of Turing machines
113-115
14
LR(0) grammar, decidability of, problems,UTM,P
and NP Problems
116-122

UNIT-1

Unit-II

UNIT-3

UNIT-4

UNIT-5

Formal Languages Automata Thery.pdf

Recommended

Recommended

More Related Content

Similar to Formal Languages Automata Thery.pdf

Similar to Formal Languages Automata Thery.pdf (20)

Recently uploaded

Recently uploaded (20)

Formal Languages Automata Thery.pdf