filmov
tv
F2021 CS 411/811 Lecture 8 (epsilon NFAs, modified subset construction for epsilon NFAs to DFAs)
Показать описание
In today's class I cover epsilon-NFAs. I show how we use a modified version of the subset construction to build a NFA from an epsilon NFA. Then I make some remarks about DFAs with dead states and also summarize everything we covered up until this point.
Time Stamps:
0:00 Opening
0:30 Formal Definition of epsilon-NFA and epsilon-closure (informal)
5:48 Formal definition of epsilon-closure, and example
20:50 Extended Transition Function for epsilon-NFAs
27:15 Language of an epsilon-NFA
31:40 epsilon-NFA to DFA conversion (modified subset construction), with example
55:20 Remark about DFAs with dead states
59:15 Summary of what we have done so far!
Time Stamps:
0:00 Opening
0:30 Formal Definition of epsilon-NFA and epsilon-closure (informal)
5:48 Formal definition of epsilon-closure, and example
20:50 Extended Transition Function for epsilon-NFAs
27:15 Language of an epsilon-NFA
31:40 epsilon-NFA to DFA conversion (modified subset construction), with example
55:20 Remark about DFAs with dead states
59:15 Summary of what we have done so far!
F2021 CS 411/811 Lecture 8 (epsilon NFAs, modified subset construction for epsilon NFAs to DFAs)
0:49:42
F2021 CS 411/811 Lecture 9 (Regular Expressions)
0:59:39
F2021 CS 411/811 Lecture 28 (Variants of TMs, Nondeterministic Turing Machine, Chomsky Hierarchy)
0:51:54
F2021 CS 411/811 Lecture 30 (Encoding a TM, Intro to Universal Turing Machines, Diagonalization)
0:53:13
F2021 CS 411/811 Lecture 29 (Countability and Diagonalization)
0:58:44
F2021 CS 411/811 Lecture 25 (Turing Machine Design, Transducers, Non-CFL Language TM)
0:53:43
F2021 CS 411/811 Lecture 10 (Regular Expressions, Kleene's Theorem (Part 1))
0:50:04
F2021 CS 411/811 Lecture 35 (Computers and TMs, Polynomial-Time, Examples, NP)
0:55:15
F2021 CS 411/811 Lecture 32 (Reductions, Decidability, Undecidability, Example)
0:53:35
F2021 CS 411/811 Lecture 7 (Proof for Equivalence of DFAs and NFAs, epsilon-NFAs)
0:55:44
F2021 CS 411/811 Lecture 34 (Time Complexity of DTMs and NTMs, Big-Oh Notation, Complexity Classes)
0:55:00
F2021 CS 411/811 Lecture 12 (Kleene's Theorem (Finale))
1:02:51
F2021 CS 411/811 Lecture 38 (NP-completeness, SAT, 3SAT, Vertex Cover, More NP-complete problems)
0:55:57
F2021 CS 411/811 Lecture 31 (Diagonalization Language is not RE, Universal Language, Undecidability)
0:52:27
F2021 CS 411/811 Lecture 23 (Properties of Context-Free Languages)
0:55:37
F2021 CS 411/811 Lecture 5 (NFA Definition, Extended Transition Function, Language of NFA, Example)
0:51:51
F2021 CS 411/811 Lecture 37 (P vs. NP, Polynomial-Time Reductions, NP-hard, NP-complete)
0:56:40
F2021 CS 411/811 Lecture 36 (NP, Poly-Time Verifiers, Examples)
0:13:19
CS411 LECTURE 8
0:54:17
F2021 CS 340 Lecture 11 (Amortized Analysis, Array Doubling/Resizable Arrays)
0:06:57
CS 411|| Short lecture || 32 lecture|| Final term preparation
1:04:29
Tutorial 7 - Proving a language is not regular, Context-Free grammars
0:08:31
3 Secrets to writing a great General Training Task 1
0:08:56
Kleene's theorem ( part 3 rule 4 ) Kleene closure of an FA | Automata Theory
Комментарии