17CS54
AUTOMATA THEORY AND COMPUTABILITY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017-2018)
SEMESTER - V

This Page Provides Information ABOUT AUTOMATA THEORY AND COMPUTABILITY - ATC Module 1
Context-Free, Non-Context-Free Languages, Where do the Context-Free Languages(CFL) fit, Showing a language is context-free, Pumping theorem for CFL, Important closure properties of CFLs, Deterministic CFLs. Algorithms and Decision Procedures for CFLs, Decidable questions, Un-decidable questions, Turing Machine, Turing machine model, Representation, Language acceptability by TM, design of TM, Techniques for TM construction

TEXT BOOK MODULE WISE
1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson Education,2012/2013
2. K L P Mishra, N Chandrasekaran , 3rd Edition, Theory of Computer Science, PhI, 2012