The video loads from YouTube only after you press Play.

Deterministic Finite Automata (Example 1)

A 10-minute video by Neso Academy about computing mechanisms and theory of computation, on the Computer science shelf. It came up in r/computerscience, in a thread called “What exactly is a Turing Machine and why is it so important”.

Neso Academy, Video, 10 min, 2016, on the Computer science shelf

TOC: Deterministic Finite Automata (Example 1) Topics discussed: An Example of DFA which accepts all strings that starts with '0'. This lecture shows how to construct a DFA that accepts all binary strings that start with '0' and rejects all that does not start with '0'.