TOC: Problem Number 4 on Conversion of Non-deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).
Topics discussed:
This lecture shows how to design an NFA that accepts all the strings over {0,1} in which the second last symbol is always '1'. After designing this, it is converted to its equivalent DFA using the Subset Construction Method.

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 #NFAtoDFA #NFA #DFA #AutomataTheory