THEORY OF AUTOMATA AND
FORMAL LANGUAGES
Text Book:
"Introduction to Languages and Theory of
Computation"
by John C. Martin McGraw-Hill
1
Computation
CPU
memory
2
temporary memory
input memory
CPU
output memory
Program memory
3
Example:
f ( x) x
3
temporar

Chapter: 5
Regular and non
regular languages
Minimization of Deterministic Finite Automata (DFA)
For any regular language L it may be possible to design
different DFAs to accept L. Given two DFAs accepting
the same language L, it is now natural to ask - w

Chapter: 4
Nondeterminism and
Kleens Theorem
NFAs: Nondeterministic Finite Automata
NFA with epsilon moves
Definition and example of a NFA with epsilon transitions.
Finite Automata with Epsilon Transitions
We can extend an NFA by introducing a "feature" t

Chapter: 3
Regular Expression
and finite automata
Regular Expressions (RE)
REs: Formal Definition
We construct REs from primitive constituents (basic elements) by
repeatedly applying certain recursive rules as given below. (In the
definition)
Definition :

Chapter 1:
Basic mathematical Objects
One-to-one, Onto, and Inverse Functions
Relation
Reflexive Relation
From the definition we know a relation is reflexive if every
element
of it is related with itself. For example, R=cfw_(1,1),(2,2), (3,3). But
if we h