Conversion of Regular Expression to Finite Automata

preview_player
Показать описание
TOC: Conversion of Regular Expression to Finite Automata

This lecture shows how to convert Regular Expressions to their equivalent Finite Automata and shows some important rules to be followed during the conversion.

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

all your videos in finite automata are really useful! thumbs up & keep up the good work! i'm having a test this evening and your videos are being so helpful with my revision. :D

monSTERRR
Автор

I can't thank you enough for such clear crystal lectures!! I am having such a hard time with this subject, although you make the lectures a breeze to go through!! thank you forever!!

sabrinanastasi
Автор

This is the real clear-cut explaining. Thanks a lot.

indikan
Автор

Guys, watch all this guys lectures on 1.5 or 1.75 speed, It will save so much time. Yea, it might me too fast for you but trust me, when u keep watching at that speed you'll eventually get used to it.

BlizZarDaSh
Автор

You are great, I enjoyed all the lecture

ibrahimshuaib
Автор

Thank you soo much . Iam great fan of neso academy

sreeharisanjeev
Автор

Thank you sir your all lectures are easy and enjoyable with all aspect
*Sir really your voice really impressive
How can we know about your self*

sayyedwaliullah
Автор

Love and thanks from West Bengal Siliguri....🖤🖤

analysisunplugged
Автор

sir if possible please upload vedios regularly so that we can finish our course with in time and you are awesome

Ankit-weym
Автор

this took my professor like 45 mins to bruh

abrarmahi
Автор

what should be the init and final state?

parikshit
Автор

in case of (a.b), you didn't mention what happens if the input to initial state, A, is b, or what happens if the input to state B is a same for example 3, the one of a* what happens if the input is b, you need a dead state then ?

ibrahimshebl
Автор

I want a link to the first video (lecture) please
:)

sattamkh
Автор

What about A+? Amazing lectures by the way😇

vitoScaletta
Автор

Why was there a slide change? without the need of any slide change.

gyanig
Автор

Sir only convertion nfa to dfa only possible sir else dfa to nfa is also there sir

manikyamthulasipriya
Автор

please make some videos on language and grammar.

turrinaga
Автор

where can we find code examples for this???

abdallahabdedaiem
Автор

no final states? no initial states mentioned in examples of dfa????

UdaySingh-zwfs
Автор

(a+b) is false, I showed your video to my professor and he said your solution is totally wrong, the automata that you made is for a(ba)^* …

marouamaroua