Automata Theory/ Introduction to Finite Automata
Lecture 01: INTRODUCTION TO LANGUAGES AND THE THEORY OF COMPUTATION
Lecture 02: Recursive Definitions
Lecture 03: Construction of Finite automata Union, interaction and complement of two finite automata
Lecture 04: Identifying δ* for DFA, NFA AND NFA-NULL
Lecture 05: Solution of assignment no 1 top down PDA.
Lecture 07: Turing machine logic for RECURSIVELY ENUMERABLE LANGUAGES. L={WW| W=(a,b)*}.
Lecture 08: TURING MACHINE for l={ww|w=(a,b)*}
Lecture 09: Preliminaries for Turing Machine. Part-I
Lecture 10: Turing Machine introduction
Lecture 11: Turing machines definition
Lecture 12: Turing Machine for language of palindromes
Lecture 13: Turing Machine for a^nb^n