Regular Languages & Finite Automata (Solved Problem 5)

TOC: Regular Languages & Finite Automata (Solved Problem 5)
Topics discussed:
A solved problem from GATE 2012 about Regular Languages and Finite Automata.

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

#TOCByNeso

[siliconmessiah]

But sir u said to that we can simply exchange the final states to obtain the transition diagram of the complement. If we do that the answer is a*

[tinotendaziramba]

Another approach will be to flip the state first, then see what the language is accepting.

[personadevwithhitsat]

Complement of NFA don't yield complement of Language it should be a*

[saipratapdannana]

bro upload more problems on gate exam.

[ayusharora]

What is the difference between phy & epsilon in TOC?

[princess]

Here, a* means 0 value of a or any values of a like a, aa, aaa... and so on. But in this case the original NFA has to have the value 'a' in order to go to the final state ... and the complemented state also needs to have 'a' to go to final state and it can also go to final state without a. Result is found from the complemented NFA diagram flipping the states. So, shouldn't the correct answer be a*? as the final state can be reached with any number of a's and also without a in the complemented NFA.

[AmrendraKumar-qwrf]

I think the correct answer would be a*. Please recheck and confirm.

[ramsurya]

please can you upload videos on the msc computer science subjects