View
Tube
search
Sign in
Sign up
Subscriptions
Anna Thomas
Formal Languages and Automata Theory (FLAT) | S5 | CST301 | KTU | 2019 Scheme
299,614 views
45 items
Last updated on Jan 8, 2024
public playlist
Anna Thomas
13:39
Basics: Symbols, Alphabets, String, Language | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
9:31
Finite Automata (FA) | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
7:28
Deterministic Finite Automata (DFA) | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
11:42
Problems from Deterministic Finite Automata | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
15:17
Minimal DFA | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
6:09
Extended Transition Function of DFA | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
7:16
Non Deterministic Finite Automata (NFA) | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
12:25
Equivalence of NFA and DFA | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
15:04
Epsilon NFA, Conversion of Epsilon NFA to NFA | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
6:55
Regular Grammar (RG) | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
13:47
Equivalence of Regular Grammar and Automata | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
8:34
Regular Expression (RE), Operations on RE | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
8:16
Problems from Regular Expression (RE) | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
16:17
Equivalence of REs and DFA, Kleene's Theorem | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
14:19
Conversion of FA to RE: State Elimination Method | CST301 | FLAT MODULE 2 | KTU | Anna Thomas |SJCET
0 views
0
Anna Thomas
4:56
Homomorphism | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
9:51
Pumping Lemma for Regular Language | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
5:42
Closure Properties of Regular Language | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
14:28
DFA State Minimization, Ultimate Periodicity | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
11:11
Myhill Nerode Theorem (MNT) | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
16:06
DFA Minimization using MNT | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
2:36
Applications of MNT | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
5:55
Context Free Grammar | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
10:45
Parse Tree, Ambiguity in CFG, Context Free Lang | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
7:48
Simplification of CFG | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
16:36
Chomsky Normal Form (CNF) | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
11:55
Greibach Normal Form (GNF) | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
11:06
Correctness of a CFG | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
12:16
Push Down Automata (PDA) | CST301 | FLAT MODULE 4 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
10:07
Problems from Push Down Automata #1 | CST301 | FLAT MODULE 4 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
13:08
Problems from Push Down Automata #2 | CST301 | FLAT MODULE 4 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
12:59
Equivalence of PDA and CFG: CFG to PDA | CST301 | FLAT MODULE 4 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
13:35
Equivalence of PDA and CFG: PDA to CFG | CST301 | FLAT MODULE 4 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
9:48
Pumping Lemma for CFL, Closure Properties of CFL | CST301 | FLAT MODULE 4 | KTU | Anna Thomas |SJCET
0 views
0
Anna Thomas
6:27
Context Sensitive Language and Grammar | CST301 | FLAT MODULE 5 | KTU | Anna Thomas |SJCET
0 views
0
Anna Thomas
12:43
Linear Bounded Automata (LBA) | CST301 | FLAT MODULE 5 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
13:31
Turing Machine (TM) | CST301 | FLAT MODULE 5 | KTU | Anna Thomas | SJCET
0 views
0
Anna Thomas
15:01
Universal Turing Machine, Decidability, RE & REC | CST301 | FLAT MODULE 5 | KTU | Anna Thomas |SJCET
0 views
0
Anna Thomas
6:24
Halting Problem of TM, Chomsky Classification | CST301 | FLAT MODULE 5 | KTU | Anna Thomas |SJCET
0 views
0
Anna Thomas
7:29
Module Wise Important Topics | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas | SJCET
0 views
0
Anna Thomas
23:12
Solved Question Paper: December 2022 (Part 1) | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas |SJCET
0 views
0
Anna Thomas
27:01
Solved Question Paper: December 2022 (Part 2) | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas |SJCET
0 views
0
Anna Thomas
21:22
Solved Question Paper: December 2022 (Part 3) | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas |SJCET
0 views
0
Anna Thomas
16:18
Solved Question Paper: December 2022 (Part 4) | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas |SJCET
0 views
0
