Module – I Introduction to Automata: The Methods Introduction to Finite Automata, Structural Representations, Automata and Complexity. Proving Equivalences about Sets, The Contrapositive, Proof by Contradiction, Inductive Proofs: General Concepts of Automata Theory: Alphabets Strings....
Read More, REGULAR EXPRESSIONS AND LANGUAGES , Finite Automata , Regular Expressions , pumping lemma proof , Closure Properties for Regular Languages , Myhill-Nerode Theorem , ....
Read More