DEEBA KANNAN

TOC Example 2 - Scenario based question Turing Machine Construction

TOC Lec 14 - minimization of DFA by Deeba Kannan

Compiler Design Lec - 42 -Syntax Directed Definitions(SDD),S-Attribute, L-Attribute,by Deeba Kannan

Artificial Neural Network - Hebb Nets - Example 2

Compiler Design Lec - 45 -Types of Three Address Statements in Compiler Design by Deeba Kannan

Compiler Design Lec-51-Syntax Directed Translation(SDT) for Flow of control statement -Deeba Kannan

TOC Lec 07-NFA to DFA conversion using subset construction by Deeba Kannan

Artificial Neural Networks - Self Organizing Map Example

Artificial Intelligent - Types of Environment in Agent Based Problem

TOC Lec 12-Regular Expression to DFA by Deeba kannan

Artificial Neural Network - Hebb Nets Example 1

Back Propagation Network Example by Deeba Kannan

Artificial Intelligence - water jug problem using BFS and DFS

TOC Lec 36-pumping lemma for context free grammar by Deeba Kannan

TOC Lec 53 - Recursive and Recursively Enumerable Language by Deeba Kannan

Artificial Intelligence - Bi-Directional Serach by Deeba Kannan

Artificial Intelligence - Resolution Algorithm by Deeba Kannan

TOC Lec 34-Context free grammar to push down automata by Deeba Kannan

Compiler Design Lec - 32 -Operator Precedence Parsing - Leading and Trailing (Part I)

Artificial Intelligence - Term in Predicate Logic by Deeba Kannan

TOC Example - Scenario based question on CNF and GNF

Compiler Design Lec - 01- Language Processing system in Compiler Design by Deeba Kannan

Theory of Computation – Context-Free Grammar for Programming Language Syntax by Deeba Kannan

TOC Lec 10 - Epsilon NFA to DFA by Deeba Kannan

TOC Lec 35-Push Down Automata to Context Free Grammar by Deeba Kannan

TOC Lec 18 - DFA to RE Rijk formula method in TOC (3 states) by Deeba Kannan

TOC Lec 13-EPSILON NFA TO DFA by Deeba Kannan

TOC Lec 15 - Part 1 - DFA to Regular Expression (State Elimination Method) by Deeba Kannan

Theory of Computation – Context-Free Grammar for Regular Expressions by Deeba Kannan

TOC Lec 54 - Properties of Recursive language by Deeba Kannan

TOC Lec 08 - NFA to DFA lazy method by Deeba kannan

Theory of Computation – Scenario-Based Example for CFG, Parse Tree, and CNF by Deeba Kannan

TOC Lec 16 - DFA to RE using state elimination method in TOC by Deeba kannan

Compiler Design Lec - 16 -RE to DFA Direct method by finding firstpos and followpos

Computational Logic - Example Natural deduction of Universal Quantifiers

Compiler Design Lec - 11 - Lexical Analyzer Generator- FA simulation by Deeba Kannan

Compiler Design Lec -52-Syntax Directed Translation(SDT) for Boolean statements (short circuit code)

Compiler Design Lec - 10 -Structure of Lex program in compiler design by Deeba Kannan

TOC Lec 09 - Regular Expression to Epsilon NFA by Deeba Kannan

TOC Example 2 - Scenario based question Finite Automata Construction

TOC Example 2 - Scenario based question Turing Machine Construction

Compiler Design Lec -48 -Syntax Directed Translation (SDT) for Assignment Statements by Deeba Kannan

Artificial Intelligence - Alpha Beta Pruning by Deeba Kannan

McCulloch-Pitts Neural Network Model – Introduction by Deeba Kannan

TOC Lec 29-introduction to Push Down Automata by Deeba Kannan

Artificial Neural Networks – Learning Vector Quantization Example by Deeba Kannan

Artificial Intelligence - Agent-Based Problems by Deeba Kannan

Theory of Computation – Context-Free Grammar for Context-Free Language by Deeba Kannan

Compiler Design Lec - 09 Input buffering by Deeba Kannan

Artificial Intelligence - Reasoning Patterns in Propositional Logic

Artificial Neural Network – Perceptron Algorithm by Deeba Kannan