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
Regular Expressions (RE),what is a RE?, Kleene’s theorem, Applications of REs, Manipulating, Simplifying REs, Regular Grammars, Definition, Regular Grammars, Regular languages, Regular Languages (RL), Non-regular Languages, How many RLs, To show that a language is regular, Closure properties of RLs, to show some languages are not RLs

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