Lecture 10_ NFA Part 1 with examples in urdu

NFA stands for non-deterministic finite automata. The finite automata are called NFA when there exist many paths for specific input from the current state to the next state. The exact state to which the machine moves cannot be determined. Hence, it is called Non-deterministic Automata. In NFA empty state transition is also allowed. This lecture covers NFA introduction with examples of string acceptance and rejection cases. In this lecture NFA is explained in detail with help of solved examples.
#AZComputing

[@miansha]

Ma Sha Allah Bhott Khoob...😊

[@aqsasarfraz426]

Very nice

[@gihs29sbsgd2]

Zabardast

[@haideralihaidi]

love

[@fahad6627]

We need a 4x speed for one day before exam preparations

[@anujpatel1310]

Sir slides milegi ki apki??

[@azcomputing]

Yes you can download it from
www.azeecomputing.com