Non Deterministic Finite Automata Solved Example 2

TOC: NFA Solved Problem 2. Topics discussed: 1. An Example of NFA which accepts all strings that start with "0". 2. An Example of NFA which accepts all strings over {0,1} of length two.