Automata Theory and Computability

18CS54-5th sem VTU ATCI

Dr. Maya B S

Assistant Professor

Department of CSE

BIT, Bangalore

VTU- Syllabus click 

Co-Po-Pso Click 

Lesson plan click  

Module-wise Question Click 

Prescribed  Text Book Click 

Reference Text Book Click 

Module -1 Text book Exercise Solution Click 

VTU-QP Click 

Test-QP Click 

Test 1,2,3 Syllabus[2020-batch]  Click 

Test-scheme(2020-batch) :click 

Module-1 PPT [Part1 (introduction) ]  , Part2 [NFA,epsilon-NFA] , Part 3 [Melay-Moore model ] 

Notes : 

Module 1-part1, Part2 

Module-2  : a.  Regular Grammar and pumping Lemma 

                    b. RG & CFG &CFL(Additional) 

Module-3: a. CFG 

                  b. PDA 

                  c. Properties of CFL(additional-notes) 

                  d. PDA(additional) 

Module-4 :      Turing Machine-Part-1    and 

                        Turing Machine Part-2 

Module-5: Decidability and application