Media Summary: UIUC CS 374 FA 20: 18.4.3. Floyd-Warshall algorithm UIUC CS 374 FA 20: 5.1.2. Algorithms for converting NFA to DFA UIUC CS 374 FA 20: 4.4. Every regular language has an NFA
Uiuc Cs 374 Fa 20 - Detailed Analysis & Overview
UIUC CS 374 FA 20: 18.4.3. Floyd-Warshall algorithm UIUC CS 374 FA 20: 5.1.2. Algorithms for converting NFA to DFA UIUC CS 374 FA 20: 4.4. Every regular language has an NFA UIUC CS 374 FA 20: 5.3. Converting NFA into a regular expression - an illustrated guide UIUC CS 374 FA 20: 4.1. Introduction to non-deterministic finite autoamatas (NFAs) UIUC CS 374 FA 20: 3.1. Introduction to DFAs
UIUC CS 374 FA 20: 18.2.3. The Bellman-Ford Algorithm Okay the last one is a bit tedious so all the string of a zero one that contained it most UIUC CS 374 FA 20: 24.4.1. Statement and sketch of idea for the proof What are languages, why there are more languages than programs, and why do we care computationally about recognizing ... UIUC CS 374 FA 20: 9.2. Introduction to the halting theorem UIUC CS 374 FA 20: 4.2. Constructing NFAs
UIUC CS 374 FA 20: 5.1. Equivalence of NFAs and DFAs (introduction) UIUC CS 374 FA 20: 3.1.1 Graphical representation of DFAs UIUC CS 374 FA 20: 7.1. Fluffy introduction to context-free grammar UIUC CS 374 FA 20: 11.1. A slow algorithm for multiplying numbers UIUC CS 374 FA 20: 23.3.2. The reduction: Encoding the formula constraints An example of a non-regular language is shown, and a sketchy proof of why it is not regular is provided.
UIUC CS 374 FA 20: 10.4. Recursion and self reductions
