Completed
00:00:06 Introduction to Automata Theory
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Automata Theory and Formal Languages Made Simple - Complete Course
Automatically move to the next video in the Classroom when playback concludes
- 1 00:00:00 Channel Intro
- 2 00:00:06 Introduction to Automata Theory
- 3 00:08:51 Basic Notations and Representations
- 4 00:23:21 What is Finite Automata and Representations
- 5 00:36:52 Types of Finite Automata
- 6 00:50:57 Problems on DFA Strings starts with-1
- 7 01:06:43 Problems on DFA Strings ends with-2
- 8 01:20:30 Problems on DFA Substring or Contains - 3
- 9 01:34:54 Problems on DFA String length - 4
- 10 01:50:10 Problems on DFA Divisibility - 5
- 11 02:05:47 Problems on DFA Evens & Odds - 6
- 12 02:19:23 Problems on NFA
- 13 02:26:49 NFA vs DFA
- 14 02:36:39 Epsilon Closure
- 15 02:46:20 Conversion of NFA with Epsilon to NFA without Epsilon
- 16 03:07:22 Conversion of NFA to DFA
- 17 03:24:57 Minimization of DFA
- 18 03:43:52 Equivalence between two DFA
- 19 03:54:16 Regular Expressions
- 20 04:07:29 Identity Rules
- 21 04:12:06 Ardens Theorem
- 22 04:23:22 Conversion of FA to RE using Ardens method
- 23 04:43:55 Conversionm of FA to RE using state elimination method
- 24 05:12:01 Conversion of RE to FA using Subset Method
- 25 05:32:30 Conversion of RE to FA using Direct Methods
- 26 05:45:11 What is Pumping Lemma
- 27 06:01:16 Regular Grammar
- 28 06:20:31 Context Free Grammar
- 29 06:29:53 Derivation Tree or Parse Tree
- 30 06:43:19 Types of Derivation Tree
- 31 06:58:27 Ambiguous Grammar
- 32 07:08:47 CFG vs RG
- 33 07:16:24 Simplification of CFG & Removal of useless production
- 34 07:24:21 Removal of Null production
- 35 07:34:17 Removal of Unit production
- 36 07:45:07 Chomsky Normal Form
- 37 08:15:18 Types of Recursions
- 38 08:29:17 Greibach Normal Form
- 39 08:55:36 Pushdown Automata
- 40 09:06:30 PDA Example-1
- 41 09:25:37 ID of PDA
- 42 09:39:30 PDA Example-2
