Conversion of NFA to DFA (Example 2)

TOC: Problem Number 2 on Conversion of Non-deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).
Topics discussed:
This lecture shows how to convert a given NFA to its equivalent DFA using the Subset Construction method.

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

#TheoryOfComputation #TOCByNeso #NFAtoDFA #NFA #DFA #AutomataTheory

[prasathmsd]

All the best for tomorrow's exam mate😂

[tanvirhasanmonir]

Millions of thanks to you dear sir. Your tutorial is the best material to learn "Theory of Computation"

[mohdamaan]

after 6 years, still helping passing semester exams.

[assaqwwq]

i love it when he asks "what is the meaning of this?". my gut reaction is of "i dont know, its not my fault"

[RahilKhan-jtut]

ans : should not start with 'ba' and must have odd no of b(s) at the end

[capitalofcambrom]

These examples are fantastic. Thanks for explaining it step-by-step!

[justinphilip]

2 years back this day, best tutorial ever

[supersakib]

Assignment Answer could be:
L = {Set of all strings over (a, b) that ends with 'b' but does not start with 'ba' and has odd number of 'b' incase of no 'a' and does not contain 'ababa'}

For both DFA abd NFA : {set of all strings over (0, 1) that does not start with 'ba' and ends with 'b' and has odd number of 'b'}

1) ends with an odd number of b’s
2) cannot start with “ba”
3) cannot contain “baba” after an even number of b’s or any number of a’s

[sahil.sjiwane]

This question came to my university paper. Thanks for the help 🌟

[siyasahoo]

The Q are really helping clearing the concept. Even after 7 years it's still helpful ❤

[SumitKumar-nekc]

So answer of the last question is :
string must contain odd number of b's after the first 'a' from the right side and also it must not contain odd number of b's before first 'a' from the left side.
all string which follow the above constraint will accept by the given NFA
please correct me, if I'm wrong.

[chocolateboyanubhab]

i am really a fan of your teaching...such complicated topics are being taught in an easy and simply wap...HATS OFF to you sir...Lots of love from the bottom of my

[tomzhang]

1) ends with an odd number of b’s
2) cannot start with “ba”
3) cannot contain “baba” after an even number of b’s or any number of a’s

[stefangjorgjevski]

answer: case1 : strings can contain only one character 'b',
case 2: start with 'a' followed by as much 'a' as you want and end with an odd number of 'b's

[viveksharma]

Thanks Neso Academy you are doing a great job for students like us. 👍

[RohitRaj-sfth]

For both DFA abd NFA, {set of all strings over (a, b) that ends with odd number of 'b'.}

[anetaivanicova]

it accepts strings that start with a*n, n=0, 1, 2.. and followed by b*n/2 != 0

[gautamkatyal]

It accepts the String start from a and nth number of a's and ends with b or String starts with b followed by b and nth number of a's and end with b.

[youucanexamprep]

Strings which are accepted in NFA and DFA both are -
1. Only b.
2. End with b.
3. End with ab.

[yuvethiekasri]

Assignment Answer could be:
L = {Set of all strings over (a, b) that ends with 'b' but does not start with 'ba' and has odd number of 'b' incase of no 'a' and does not contain 'ababa'}