CS301 / CST301:Theory of Computation (ToC)/ Formal Languages and Automata Theory
59 videos • 415,222 views • by by Greeshma G S
SEM 5 CSE- KTU syllabus# 2015 scheme #2019 scheme
1
CS301 / CST301-mod_1: (1) INTRODUCTION TO ToC - #ToC Lecture 01
Greeshma G S
Download
2
2) NECESSITY OF FINITE AUTOMATA - # ToC Lecture 02
Greeshma G S
Download
3
3) FINITE AUTOMATA(FA) - # ToC Lecture 03
Greeshma G S
Download
4
4) DETERMINISTIC FINITE AUTOMATA (DFA) -Definition and construction - # ToC Lecture 04
Greeshma G S
Download
5
5) DFA - CONSTRUCTION (problems) - # ToC Lecture 05
Greeshma G S
Download
6
6) DFA CONSTRUCTION- EXAMPLE - #ToC Lecture 06
Greeshma G S
Download
7
7) DFA examples # ToC Lecture 07
Greeshma G S
Download
8
8) NON-DETERMINISTIC FINITE AUTOMATA (NFA) #Toc Lecture 08
Greeshma G S
Download
9
9) ACCEPTANCE OF STRING BY FINITE AUTOMATA#Toc Lecture 09
Greeshma G S
Download
10
10) DESIGNING NFA #(problems)# Toc Lecture 10
Greeshma G S
Download
11
11) FINITE AUTOMATA WITH EPSILON TRANSITIONS #Toc Lecture 11
Greeshma G S
Download
12
12) CONVERTING NFA TO DFA #ToC Lecture 12
Greeshma G S
Download
13
13) EPSILON- NFA to NFA #ToC Lecture 13
Greeshma G S
Download
14
14) CONVERSION OF EPSILON-NFA TO DFA #TOC Lecture 14
Greeshma G S
Download
15
15) EQUIVALENCE OF NFA WITH & WITHOUT €- TRANSITIONS #TOC Lecture 15
Greeshma G S
Download
16
16) DFA CONSTRUCTION OVER BINARY NUMBERS #TOC Lecture 16
Greeshma G S
Download
17
17) DFA MINIMISATION- Equivalence Method Eg:01 #toc Lecture 17
Greeshma G S
Download
18
18) Ex 02- DFA MINIMISATION ( Equiv.method) # TOC Lecture 18
Greeshma G S
Download
19
19) MYHILL NERODE THEOREM (TABLE FILLING METHOD)-DFA MINIMISATION #Toc Lecture 19
Greeshma G S
Download
20
20) MOORE AND MEALY MACHINE-INTRODUCTION #ToC#Lecture 20
Greeshma G S
Download
21
21) DESIGNING MOORE MACHINE #ToC Lecture 21
Greeshma G S
Download
22
22) MEALY MACHINE DESIGN# ToC Lecture 22
Greeshma G S
Download
23
23) TWO WAY FINITE AUTOMATA # ToC Lecture 23
Greeshma G S
Download
24
24) REGULAR EXPRESSION - INTRODUCTION #TOC Lecture 24
Greeshma G S
Download
25
25) CONSTRUCTION AND PRECEDANCE OF RE# ToC Lecture 25
Greeshma G S
Download
26
26) EXAMPLES(1) OF REGULAR EXPRESSION #ToC Lecture 26
Greeshma G S
Download
27
27) EXAMPLES(2) OF REGULAR EXPRESSION# ToC Lecture 27
Greeshma G S
Download
28
28) EQUIVALENCE OF REGULAR EXPRESSION AND NFA WITH EPSILON TRANSITION#ToC Lecture 28
Greeshma G S
Download
29
29) CONSTRUCTON/CONVERTING REGULAR EXPRESSION TO EPSILON NFA(FINITE AUTOMATA) #ToC Lecture 29
Greeshma G S
Download
30
30) CONVERTING DFA TO REGULAR EXPRESSION#ToC Lecture 30
Greeshma G S
Download
31
31) EQUIVALENCE OF DFA AND REGULAR EXPRESSION #ToC Lecture 31
Greeshma G S
Download
32
32) STATE ELIMINATION METHOD (FA to RE conversion) # ToC Lecture 32
Greeshma G S
Download
33
33) PUMPING LEMMA INTRODUCTION#ToC Lecture 33
Greeshma G S
Download
34
[Private video]
Download
35
35) CONTEXT FREE GRAMMAR #ToC Lecture 35
Greeshma G S
Download
36
36) CFG EXAMPLES # TOC Lecture 36
Greeshma G S
Download
37
37) AMBIGUOUS GRAMMAR # ToC Lecture 37
Greeshma G S
Download
38
38) SIMPLIFICATION/REDUCTION OF CFG #ToC Lecture 38
Greeshma G S
Download
39
39) REMOVAL OF UNIT PRODUCTION & NULL PRODUCTION IN CFG #ToC Lecture 39
Greeshma G S
Download
40
40) CHOMSKY NORMAL FORM (CNF) #ToC Lecture 40
Greeshma G S
Download
41
41) GREIBACH NORMAL FORM (GNF) # ToC Lecture 41
Greeshma G S
Download
42
42) PUSH DOWN AUTOMATA(PDA)- INTRODUCTION #ToC Lecture 42
Greeshma G S
Download
43
43) PDA - EXAMPLE( equal 0 and 1s, Even palindrome) #ToC Lecture 43
Greeshma G S
Download
44
44) EQUIVALENCE OF PDA ACCEPTANCE BY EMPTY STACK AND FINAL STATE #ToC lecture 44
Greeshma G S
Download
45
45) EQUIVALENCE OF PDA AND CFG(Part 1) # ToC Lecture 45
Greeshma G S
Download
46
46) EQUIVALENCE OF PDA AND CFG (Part 2) #ToC Lecture 46
Greeshma G S
Download
47
47) TURING MACHINE - BASICS #ToC Lecture 47
Greeshma G S
Download
48
48) TURING MACHINE -FORMAL DEFINITION #ToC Lecture 48
Greeshma G S
Download
49
49) DESIGNING TURING MACHINE ( 2 Problems solved) # ToC Lecture 49
Greeshma G S
Download
50
50) TURING MACHINE- EVEN PALINDROME #ToC lecture 50
Greeshma G S
Download
51
51) PUMPING LEMMA FOR CFLs #ToC Lecture 51
Greeshma G S
Download
52
52) CONTEXT SENSITIVE GRAMMAR (CSG) #ToC Lecture 52
Greeshma G S
Download
53
53) LINEAR BOUNDED AUTOMATA (LBA) #ToC Lecture 53
Greeshma G S
Download
54
54) UNIVERSAL TURING MACHINE #ToC Lecture 54 # Module 6
Greeshma G S
Download
55
55) NON-DETERMINISTIC TM #ToC Lecture 55
Greeshma G S
Download
56
56) MULTI-TAPE TM # ToC Lecture 56
Greeshma G S
Download
57
57) RECURSIVE LANG(REC) & RECURSIVE ENUMERABLE LANG (RE), PROPERTIES OF REC,RE #TOC Lecture 57
Greeshma G S
Download
58
58) DECIDABILITY & HALTING PROBLEM #ToC Lecture 58
Greeshma G S
Download
59
59) PDA example with ID(instantaneous description) # ToC Lecture 59
Greeshma G S
Download