Automata Theory (Includes Typical MCQ's) For MU Sem 5 Information Technology Course Code :ITC404  (Hardcover, Ashish Budhrani)

Detailed Syllabus Sr. No. Module Detailed Contents Hrs. CO Mapping 0 Prerequisite Basic Mathematical Fundamentals: Sets, Logic, Relations, Functions. 02 – I Introduction and Regular Languages Languages : Alphabets and Strings. Regular Languages: Regular Expressions, Regular Languages, Regular Grammars, RL and LL grammars, Closure properties Self-learning Topics : Practice exercise on Regular Expressions. Identify the tools also. (Refer Chapter 1) 05 CO1 II Finite Automata Finite Automata : FA as language acceptor or verifier, NFA (with and without ?) , DFA, RE to NFA, NFA to DFA, Reduced DFA , NFA-DFA equivalence, FA to RE. Finite State Machines with output : Moore and Mealy machines. Moore and Mealy M/C conversion. Limitations of FA. Self-learning Topics : Practice exercise on FA and NFA (Refer Chapter 2) 09 CO2 III Context Free Grammars Context Free Languages : CFG, Leftmost and Rightmost derivations, Ambiguity, Simplification and Normalization (CNF & GNF) and Chomsky Hierarchy ( Types 0 to 3). Self-learning Topics : Practice numerical or exercise on CFG. (Refer Chapter 3) 08 CO3 IV Push Down Automata Push Down Automata : Deterministic (single stack) PDA, Equivalence between PDA and CFG. Power and Limitations of PDA. Self-learning Topics : List the examples of PDA. (Refer Chapter 4) 05 CO4 V Turing Machine Turing Machine : Deterministic TM, Variants of TM, Halting problem, Power of TM. Self-learning Topics : Practice numerical of TM. (Refer Chapter 5) 07 CO5 VI Applications of Automata Applications of FA, CFG, PDA & TM. Introduction to Compiler & Its phases. Self-learning Topics : Case study on any one compiler. (Refer Chapter 6) 03 CO2, CO3, CO4, CO5, CO6