Completed
12-DIFFERENCES BETWEEN DFA & NFA IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Automata Theory and Formal Languages - Complete Course
Automatically move to the next video in the Classroom when playback concludes
- 1 01-INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES
- 2 02-BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY ||BASICS OF AUTOMATA|| THEORY OF COMPUTATION
- 3 03-WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION
- 4 04-TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
- 5 05-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC
- 6 06-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 2 (STRINGS ENDS WITH) IN AUTOMATA THEORY || TOC
- 7 07-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 3 (SUBSTRING OR CONTAINS) IN AUTOMATA THEORY || TOC
- 8 08-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC
- 9 09-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 5 (DIVISIBLE BY) IN AUTOMATA THEORY || TOC
- 10 10-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC
- 11 11-NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EXAMPLE IN AUTOMATA THEORY || THEORY OF COMPUTATION
- 12 12-DIFFERENCES BETWEEN DFA & NFA IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
- 13 13-EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC
- 14 14-CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN AUTOMATA THEORY || TOC
- 15 15-CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC
- 16 16-MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC
- 17 17-EQUIVALENCE BETWEEN TWO DFA IN AUTOMATA THEORY || EQUIVALENCE BETWEEN TWO FSM'S || TOC
- 18 18-REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC
- 19 19-IDENTITY RULES FOR REGULAR EXPRESSIONS IN AUTOMATA THEORY | IDENTITIES OF REGULAR EXPRESSIONS|TOC
- 20 20-ARDEN'S THEOREM IN AUTOMATA THEORY || EQUIVALENCE OF TWO REGULAR EXPRESSIONS || DFA TO RE || TOC
- 21 21-CONVERSION OF FINITE AUTOMATA TO REGULAR EXPRESSION USING ARDENS METHOD IN AUTOMATA THEORY || TOC
- 22 22-CONVERSION OF FINITE AUTOMATA TO RE USING STATE ELIMINATING METHOD IN AUTOMATA THEORY || TOC
- 23 23-CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING SUBSET METHOD IN AUTOMATA THEORY || TOC
- 24 24-CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING DIRECT METHOD IN AUTOMATA THEORY || TOC
- 25 25-PUMPING LEMMA IN AUTOMATA THEORY || PUMPING LEMMA FOR REGULAR LANGUAGES WITH EXAMPLES || TOC
- 26 26-REGULAR GRAMMAR IN AUTOMATA THEORY || GRAMMAR || LEFT LINEAR GRAMMAR ||RIGHT LINEAR GRAMMAR ||TOC
- 27 27-CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || CFG IN ATFL || TOC || AUTOMATA THEORY
- 28 28-DERIVATION TREE / PARSE TREE IN AUTOMATA THEORY || DERIVATION || TOC
- 29 29-TYPES OF DERIVATION TREE (LEFT-MOST & RIGHT MOST) IN AUTOMATA THEORY || TOC
- 30 30-AMBIGUOUS GRAMMAR IN AUTOMATA THEORY || AMBIGUITY IN CONTEXT FREE GRAMMAR || TOC
- 31 31-DIFFERENCE BETWEEN REULAR GRAMMAR AND CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || TOC
- 32 32-REMOVAL OF USELESS PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
- 33 33-REMOVAL OF NULL (EPSILON) PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
- 34 34-REMOVAL OF UNIT PRODUCTIONS - SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC
- 35 35-CHOMSKY NORMAL FORM (CNF) & CONVERSION OF CFG TO CNF IN AUTOMATA THEORY || CFG TO CNF || TOC
- 36 36-TYPES OF RECURSIONS AND REMOVAL OF LEFT RECURSION IN AUTOMATA THEORY || LEFT RECURSION || TOC
- 37 37-GREIBACH NORMAL FORM (GNF) AND CONVERSION OF CONTEXT FREE GRAMMAR TO GNF IN AUTOMATA THEORY ||TOC
- 38 38-PUSHDOWN AUTOMATA (PDA) IN AUTOMATA THEORY || PDA INTRODUCTION || WHAT IS PDA ? || TOC
- 39 39-PUSHDOWN AUTOMATA EXAMPLE (a^n b^n) || PDA EXAMPLE || TOC
- 40 40-PUSHDOWN AUTOMATA EXAMPLE - 2 (a^n b^m c^n) || PDA EXAMPLE - 2 || TOC
- 41 41-INSTANTANEOUS DESCRIPTION (ID) OF PDA IN AUTOMATA THEORY || ID OF PDA ||ACCEPTANCE OF STRING||TOC
- 42 Automata Theory & Formal Languages Made Simple || Complete Course || TOC || FLAT || ATFL
