91,409 views 305 on YTPak
188 52

Published on 28 May 2014 | over 3 years ago

A very simple video explaining the conversion of Non-deterministic Finite Automata to Deterministic Finite Automata.
Learn how to convert NFA to DFA.
Also learn how to combine multiple states of an NFA to form a single state of DFA in the process of conversion.

To learn what a NFA is watch this video:
www.youtube.com/watch

To learn what a DFA is watch this video:
www.youtube.com/watch

To learn what a Regular Expression is watch this video:
www.youtube.com/watch


Follow us on Twitter : @theunacademy
Like us on Facebook : www.facebook.com/unacademy

Subscribe to the channel and support us make learning easier.

Loading related videos...
(function(){ var spoutjs=document.createElement('script'),firstjs=document.getElementsByTagName('script')[0]; spoutjs.async=1; spoutjs.src='//cdn.spoutable.com/0f93c30c-199b-4e71-90dc-dbb5de72cee5/spoutable.js'; firstjs.parentNode.insertBefore(spoutjs,firstjs) })(); */ ?>