LANGUAGES PART 1
SYMBOLS , FINITE AUTOMATE PART 2
UNION , INTERSECTION AND COMPLEMENT LANGUAGES PART 4
UNION , INTERSECTION AND COMPLEMENT LANGUAGES PART 5_1
ACCEPTANCE BY NFA PART 6
CONVERSION FROM NFA TO FA PART 7
CONVERSION FROM NFA TO FA PART 8
FREQUENCY RESPONSE PART 9
KLEENE THEOREM PART 10
KLEENE THEOREM PART 11
PART 2
PART 3
PART 4
PART 5
PART 6
PART 1
Mod 2.pdf
Mod 3.pdf
Mod 3,4.pdf
Mod4.pdf
Module 3
Module 4
Sample