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. Full Course on TOC: https://goo.gl/f4CmJw Follow Neso Academy on Instagram: @nesoacademy (https://bit.ly/2XP63OE) Follow me on Instagram: @jaiz_itech (https://bit.ly/2M3xyOa) Contribute: http://www.nesoacademy.org/donate Memberships: https://bit.ly/2U7YSPI Books: http://www.nesoacademy.org/recommended-books Website ► http://www.nesoacademy.org/ Forum ► https://forum.nesoacademy.org/ Facebook ► https://goo.gl/Nt0PmB Twitter ► https://twitter.com/nesoacademy Music: Axol x Alex Skrindo - You [NCS Release] #TheoryOfComputation #TOCByNeso #NFA #NFAQuestion #AutomataTheory