Regular Languages & Finite Automata (Solved Problem 3) Neso Academy

TOC: Regular Languages & Finite Automata (Solved Problem 3)
Topics discussed:
A solved problem from GATE 2012 using the Identities of Regular Expression

Contribute: http://www.nesoacademy.org/donate

Books: http://www.nesoacademy.org/recommende...

Website ► http://www.nesoacademy.org/
Forum ► http://forum.nesoacademy.org/
Facebook ► https://goo.gl/Nt0PmB
Twitter ► https://twitter.com/nesoacademy
Pinterest ► http://www.pinterest.com/nesoacademy/

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

#TOCByNeso

Best comment

1. Dipak Salunke: It is correct as final state 10 on input 0 will go to final state 00 till now any substring in any string formed will have 2 zeroes later if it gets another zero then substring with 3 zeroes will be formed and then final state 00 will go to the dead state or sink state q .
2. soumya nicky: +Dipak Salunke (D) accepts the string 0100 :/
3. Dipak Salunke: +soumya nicky It is designed to do so..! Read the problem statement carefully :)
4. Uttam Rathore: in option D if we check in transition table the input 0 for states (10,00). it also is false.. HELP!!

Regular Languages & Finite Automata (Solved Problem 3)
17,885 views views	468,989 followers
46 Likes	46 Dislikes
Education	Upload TimePublished on 8 May 2018
analog electronics projects, analog electronics kit, analog electronics pdf, analog electronics definition, analog electronics course, analog electronics textbook, analog electronics examples, analog electronics book, analog electronics circuits, analog electronics design, analog electronics tutorial, analog electronics vs digital electronics, analog electronics interview questions, analog electronics jobs, analog electronics applications, analog electronics syllabus, analog electronics rutgers, analog electronics devices circuits and techniques, analog electronics with labview, analog electronics analog circuits explained,