Click to Watch in HD > Theory of Computation | DFA and NDFA Study | Acceptability of Strings

Watch In this video i have discussed about the following topics for which i have given the time stamp links:1. Major point of difference between Finite Automata and Transition System - 0:322.Discussion about Finite automata and building transition table from transition diagram - 01:453. Acceptability of string by finite automata - 05:214. Examples of string acceptability by finite automata (Part-1) - 07:315. Examples of string acceptability by finite automata (Part-2) - 11:116. Examples of string acceptability by finite automata (Part-3) - 12:457. Examples of string acceptability by finite automata (Part-4) - 14:528. Non Deterministic finite automata (NDFA) - 16:149. Analytical definition of Non deterministic finite automata - 18:3510. Difference between DFA and NDFA , Difference of Transition function in case of deterministic finite automata and non deterministic finite automata - 19:2611. Acceptability of string by non deterministic finite automata example -1 - 21:5812. Acceptability of string by non deterministic finite automata example -2 - 25:3513. Acceptability of string by non deterministic finite automata example -3 - 28:0814. Acceptability of string by non deterministic finite automata example -4 - 30:2915. 2 important points about finite automata - 34:16 ________________________________________________________________★ Click Here To Subscribe: https://goo.gl/wT3DT4★ Salil Abrols Instagram: ★ Salil Abrols Facebook: https://www.facebook.com/tutorialmart/★ Business or Media contact: [email protected]________________________________________________________________Daybreak by Kevin MacLeod is licensed under a Creative Commons Attribution license (https://creativecommons.org/licenses/...)Source: http://incompetech.com/music/royalty-...Artist: http://incompetech.com/

Youtube Channel / Salil Abrols Tutorial Mart
Loading