Automata Theory and compiler Design
B20AM2203
Syllabus Model Paper Assignment1
MID 1 Database
Mid 1 Objective database
MID2 Database
Unit-1
Introduction
DFA and NFA
NFA to DFA conversion
NFA with Epsilon Transitions
Minimization of DFA
Mealy and Moore Machines
Regular Expressions
RE to NFA with Epsilons
Unit-2
Introduction to CFG
CFG derivations, Ambiguous grammar
Pumping lemma on Regular sets
Closure Properties of Regular sets