These note are very nicely written in good handwriting to help student easily grasp the concept and become able to solve the GATE problems. Notes contains theory, concepts and solved examples wherever necessary.
Topic Covered:Regular expressions and finite automata. Context-free grammars and push-down
automata. Regular and contex-free languages, pumping lemma. Turing machines and