filmov
tv
Theory of Computation #10: Non-deterministic Finite Automata
Показать описание
In the previous video we looked at a formal definition of DFA. In this video we extend the definition to non-deterministic automata, and look at some variations in the definition of NFA.
Hope you are able to understand NFA formally from the video. If you have any questions, feel free to drop them in the comments section!
Hope you are able to understand NFA formally from the video. If you have any questions, feel free to drop them in the comments section!
0:06:38
0:06:27
0:21:09
0:18:37
0:08:03
0:16:44
0:11:48
0:08:41
0:09:44
0:07:26
0:08:54
0:04:44
0:09:15
0:09:01
0:14:38
0:06:28
0:09:48
0:06:21
0:07:00
0:28:17
0:06:09
0:37:57
0:05:49
0:12:22