VTU AUTOMATA THEORY AND COMPILER DESIGN -MODULE-1

 

MODULE-1: Introduction to Automata Theory: Central Concepts of Automata theory, Deterministic Finite Automata(DFA), Non- Deterministic Finite Automata(NFA) ,Epsilon- NFA, NFA to DFA Conversion, Minimization of DFA Introduction to Compiler Design: Language Processors, Phases of Compilers Textbook 1: Chapter1 – 1.5, Chapter2 – 2.2,2.3,2.5 Chapter4 –4.4 Textbook 2: Chapter1 – 1.1 and 1.2

---------------------------------------------------------------------------------------------------------------

CLICK here FOR NOTES -MODULE-I

---------------------------------------------------------------------------------------------------------------

REFRENCES

Textbooks

1. John E Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,“ Introduction to Automata Theory, Languages and Computation”, Third Edition, Pearson.

2. Alfred V.Aho, Monica S.Lam,Ravi Sethi, Jeffrey D. Ullman, “ Compilers Principles, Techniques and Tools”, Second Edition,Perason.

 

Reference:

1. Elain Rich, “Automata,Computability and complexity”, 1st Edition, Pearson Education,2018.

2. K.L.P Mishra, N Chandrashekaran , 3rd Edition , ‘Theory of Computer Science”,PHI,2012.

3. Peter Linz, “An introduction to Formal Languages and Automata “, 3rd Edition, Narosa Publishers,1998.

4. K Muneeswaran, ”Compiler Design”, Oxford University Press 2013.