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
Why study the Theory of Computation, Languages and Strings, Strings, Languages, A Language Hierarchy, Computation, Finite State Machines (FSM), Deterministic FSM, Regular languages, Designing FSM, Nondeterministic FSMs, From FSMs to Operational Systems, Simulators for FSMs, Minimizing FSMs, Canonical form of Regular languages, Finite State Transducers, Bidirectional Transducers,

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