Regular Languages: Deterministic Finite Automaton (DFA)
![](https://i.ytimg.com/vi/W8Uu0inPmU8/mqdefault.jpg)
6:37
Regular Languages: Nondeterministic Finite Automaton (NFA)
![](https://i.ytimg.com/vi/40i4PKpM0cI/mqdefault.jpg)
9:48
Deterministic Finite Automata (Example 1)
![](https://i.ytimg.com/vi/vh_Af8oWkGw/mqdefault.jpg)
17:59
I Animated VIDEOGAME Icons in Blender 3D
![](https://i.ytimg.com/vi/vhiiia1_hC4/mqdefault.jpg)
8:52
Computers Without Memory - Computerphile
![](https://i.ytimg.com/vi/qtnNyUlO6vU/mqdefault.jpg)
5:11
What is the Pumping Lemma
![](https://i.ytimg.com/vi/zF3RjLpYMUE/mqdefault.jpg)
16:23
Deterministic Finite State Machines - Theory of Computation
![](https://i.ytimg.com/vi/N_N9Ky6tN_s/mqdefault.jpg)
18:55
A Quick Non-Deterministic to Deterministic Finite Automata Conversion
![](https://i.ytimg.com/vi/9syvZr-9xwk/mqdefault.jpg)
1:00:34