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.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #NFA #NFAQuestion #AutomataTheory

[RishikavsAnnie]

Would the NFA have been complete even without the self-loop at B ? Because once the first input 0 has been received, the string can be accepted (reach the final state) and it doesn't matter what happens at B.

[LordSarcasticVlogger]

WATCHING FROM NIT SRINAGAR i.e 17/04/2024 AND I AM FEELING SAD TODAY FOR SOME PERSONAL REASONS

[LucKy-kdfs]

Amazing job! You've been a lifesaver for me!! Thank you so much :)))

[deepakswarnabarath]

thank you so much for the effort to make the concepts clear to the viewers

[devmahad]

This video explains the example of NFA. We have the Liberty to leave the state. uncompleted, which was not in the case of DFA. In NDFA, We have dead configurations.

[rajatdotwal]

Accepts all strings that ends with odd no. of b or end with ab

[saifshaikh]

There isn't Dead State in NFA ? correct me if I am wrong.

[zoasis]

In an earlier video you said, in a DFA, if a transition for a given input doesn't exist we can assume that it leads to a dead state. Doesn't that mean that this NFA could be considered a DFA just with the assumption that an input of 1 at A transitions us to a dead state?

[sulemanali]

Can you make NFA for vending machine that accepts rupees (10, 20, 50) if you want to purchase a can of Rs.50

[praveenkumar-ybge]

A(0, 1)>B(0, 1) will it be wrong b will be final state

[johannesalbrecht]

Isn't the second NFA actually a DEA? There are never two states you can choose between.

[dhruvtonemare]

Sir equivalent states would be 3 as we have to gove input for every state

[Ankit-weym]

dear sir if possible may you upload lecture of CO

[bullyversal]

why we cannot loop zero to itself A and call it final state?

[LadderVictims]

note how you can ignore input of 1 from starting state, for nfa it can be ignored

[kanimozhin]

isn't the example in the last question a dfa in the sense that it has only one transition for each input?

[pradyumnabharadwaja]

If i could not find this playlist of videos i would have failed my tests of TOC

[DeepakSingh-fnzi]

If we don't make any self loop at B Then it can also be correct????

[vishalplayzz]

cant we make a self-loop at 1:24 for A .? LIKE if A is given 0 It may go to B or A again ? is that wrong ?

[SuperDevzz]

How is string 001 acceptable if it is clearly mentioned in the question above testing acceptability of strings ending in 0?