dear neso academy , you have always helped me in my engineering journey. I am so grateful that we have teachers like you. Thanking you from the core of my heart🥰🥰
@mukesh565210 ай бұрын
💯
@ziliestarrive5 жыл бұрын
Thank you so much for this. My lecturer makes the material super confusing and while the textbook(Hopcroft) is good, it's really wordy and takes forever to get to the working knowledge, given that it uses proofs to introduce new concepts. This is perfect.
@grassroots992 жыл бұрын
I'm jealous that you've long been done with this course haha
@Soulhunter175 жыл бұрын
This video has a pretty good quality to show the very basic steps on how to do it with good explanation. Exactly what I was looking for. Thank you! =)
@HabiburRahamaniit3 жыл бұрын
You are a saviour . I am from IIT KGP, I follow your lectures from the very first year. Thanks .
@mrsmurf9112 жыл бұрын
bahut harami ho beta
@goutamshaw4225 Жыл бұрын
😅F gg for free ho o; hj
@poojakatiyar7380 Жыл бұрын
Hy
@yashtripathi9079 Жыл бұрын
heyyy@@poojakatiyar7380
@poojakatiyar7380 Жыл бұрын
@@KaushikcraftAI give your insta id
@bishalmohari87484 жыл бұрын
Your explanations are just so concise . Love your work
@visheshkumar15 Жыл бұрын
00:01 Converting regular expressions to equivalent finite automata 01:11 Conversion of Regular Expression to Finite Automata - Examples (Part 1) 02:12 Conversion of Regular Expression to Finite Automata - Examples (Part 1) 03:20 Conversion of Regular Expression to Finite Automata - Examples (Part 1) 04:23 Finite Automata accepts strings based on the given regular expression 05:30 Design finite automaton for a BC closure 06:41 Finite Automata Closure 07:47 Conversion of Regular Expression to Finite Automata Crafted by Merlin AI.
@vectrex285 жыл бұрын
Thanks for the videos, I might just ace my exam tomorrow thanks to them :)
@grizzthekid Жыл бұрын
I literally sing along to the intro song because that’s how great the lectures are.
@JD_Mapes3 жыл бұрын
Pretty sure I need to be paying you instead of my school
@mohtrz57593 жыл бұрын
i can agree for this :)
@eyramakahoho93032 жыл бұрын
I agree
@habbometin2csocapb2 жыл бұрын
Same thing
@nihalwaseem7106 Жыл бұрын
Totally agree bro🔥
@lucknawi_ladka62 Жыл бұрын
Which country are u from?
@missecah17313 жыл бұрын
Thank you very much. I'm having trouble understanding regular expression in automata
@chabotaluputa76657 ай бұрын
Awesome,for the last one I made only two states,it still worked
@trollerninja43566 жыл бұрын
I have to say this....thanks a fucking ton.....I despised this subject...it sucked for me......and I have my midterm in 2 hrs...started watching yur videos few hrs back...and I absolutely love solving these problems....its about how one is taught that changes the student's approach towards the subject....thanks a lot again...!!!
@swatiaryaa92682 жыл бұрын
Thank you so much sir ,,love from India✌️✨🥰
@utsavbudathoki23846 жыл бұрын
thank you sir ..all my doubt are clear now
@shahzadafathurrahmanbscs-27732 жыл бұрын
for question 3. if you have string ac or ab as there is star over bc, so one can pick any number of b or any number of c, so by doing that we won't reach the final state?
@adityaaryan2412 Жыл бұрын
We won't reach final like that as we always need 'b' and 'c' together and also at the end of the string.
@sebastianarturoobandomayor15547 жыл бұрын
Thank You Thank YOU !! Thank YOU !!! for ALL the videos !! :D Really Thank YOU
@SasiKumar-pk5uf Жыл бұрын
I am sure because I spent a useful time for this video
@pallavikavalipati14313 жыл бұрын
for a(bc)* can we return both bc to final state b instead of another state c?
@shantanujoshi2903 жыл бұрын
same doubt
@latalabatagoshu53412 жыл бұрын
I was thinging that too.
@collegematerial53482 жыл бұрын
Bc we should make one transition fir B and another for C
@arshitaanchaliya15832 жыл бұрын
I think no because if u make b,c on b only it means that it accept the string abbb, ACCC, also but here we have bc repeating not b or c ....
@pkm252011 ай бұрын
@@arshitaanchaliya1583 when a self loop is given to B for b,c, when b is given self loop happens ab when c is given self loop happens abc will work na?
@chavaligangadevi8663 Жыл бұрын
good explanation sir
@studywithme45998 ай бұрын
Thanks for the video best video on finite automata
@rrsc077 ай бұрын
ee bc bc bc bc😂😂😂😂..... I started laughing in the library lol
@tharindumarapana66702 жыл бұрын
Very clear explanation. Thanks much
@ilmnafi34 ай бұрын
thanks great explination 😊
@divinesoul3311 Жыл бұрын
in the third question can we add a self loop to b for inputs b,c instead ?
@marianeziade1997 Жыл бұрын
I did the samee and it make more sence cause b ans c should be togheter not like he did but im not sure if its right
@stardust351110 ай бұрын
nope, in that case, after 'a' if you only read 'b', it ends up at a final state though "ab" is not an accepted string
@martinriedl41392 жыл бұрын
Great explanation! 👍
@whysoserious88062 жыл бұрын
found this channel just a day before my exam damn I'm unlucky🙂
@piyushmishra8602 жыл бұрын
Tq so muchh sir ♥️
@buzzfeedRED6 жыл бұрын
+Neso Academy Please give the answers when students asked to , You always said in your video if U have a doubt then Comment it , i will answer
@manindermanish38437 жыл бұрын
Sir ,Is there no need to show the dead state or trap state in making the dfa of these examples
@emrekara3694 жыл бұрын
you are right
@manindermanish38433 жыл бұрын
@Shivansh Thapliyal its none of my use now i use these lectures when i was doing MCA and neso academy is the only academy at that time which help me alot to pass these subjects anyway thanks for your reply work hard play hard
@pkm252011 ай бұрын
@@manindermanish3843 what are you doing now g
@darkblack9958 Жыл бұрын
Thank you teacher!
@shahzadafathurrahmanbscs-27732 жыл бұрын
To my little knowledge , in finite automata every state and transition should be determined, as there is no trap state after the final state so its more of an NFA.
@akashchoudhary81622 жыл бұрын
That's for DFA. In the qn it was just mentioned FA. DFA and NFA are both FA
@shweta73623 жыл бұрын
Very helpful🙌😄
@meghanareddy96425 жыл бұрын
Super explanation sir
@sadikabdullahi2883 жыл бұрын
Tomorrow I have a theory of computing exam:
@harshekka60899 ай бұрын
Same bro
@GOLDENBOYRICHIE5 ай бұрын
Same here on Monday
@rajeshmedia0.25 ай бұрын
Yes@@GOLDENBOYRICHIE
@fadelcmd99695 жыл бұрын
Sir please make a video about Regular expression to Epsilon NFA Conversion, thankyou
@NOLAMarathon20105 жыл бұрын
Worth noting that none of these conversions were to DFA's. All the conversions were to NFA's.
@tavasoli2 жыл бұрын
I know it's been 2 years but could you elaborate more? Here, there are no epsilon-transitions and no two identically labeled transitions out of the same state. So, it is fine with the definition of DFA.
@prohightension20002 жыл бұрын
@@tavasoli no a DFA has to have all the inputs and their outputs which means all the state has to have all the inputs
@AadeshingaleOfficial-zl5fd4 ай бұрын
Nice Sir 😊
@vinayaddagatla15696 жыл бұрын
in 3rd example if input given is only a then it goes to final state but according to regular expression it should go to final state only if input is like abc abcbc abcbc..... please explain if my doubt is correct.
@chinmaysingh5136 жыл бұрын
a is also a valid expression since it is (bc)* so it can be epsilon as well so a or a followed by any number of (bc)
@vinayaddagatla15696 жыл бұрын
@@chinmaysingh513 thanks got it
@amirsuhel7184 Жыл бұрын
My exam is day after tomorrow. I guess you will make me pass.
@nikhilreddy7192 жыл бұрын
Thank you, sir
@AnuRajpoot-h4u7 ай бұрын
Thanku sir ❤
@saisreenivas88756 жыл бұрын
In the 2nd example,string aac is also accepted right?Then how is that correct?
@shahinshaikh075 жыл бұрын
The string "aac" will not be accepted. (a+b) means either a or b will be read before 'c'..... It will read only one from 'a' and 'b'
@rezaarian2372 жыл бұрын
on c part bc can produce lamda right ?
@swm7f1377 жыл бұрын
you are the best thanks alots
@stealth50k7 жыл бұрын
Great videos :)
@vaggelismanousakis61475 жыл бұрын
Is there a diffrence between NFA and DFA regarding their automata design ? Is there any video related to that with examples? Thanks in advance
@ayushanand18 Жыл бұрын
The difference lies in the rules for it. DFA cannot have two different transitions on the same symbol from a state or a null transition, but NFA can. We ought to implement a deterministic machine and so every NFA must be converted to DFA before implementation (physically). So design perspective they are different because of the transitions that are allowed.
@mridulanand102 жыл бұрын
sir in 3rd part why didn't you go for more than 3bc's?
@saravana___6 ай бұрын
for closure in last example, do we need to give a self loop sir
@mohdluai18085 ай бұрын
for the 2nd example (a+c)b why is the + operator considered or rather than one or more 'a'?
@johnyhawkahsan7 жыл бұрын
Thank you so much
@pp-xc8kb2 жыл бұрын
can anyone tell me briefly what is the useage of this? I just learn it from my university but don´t know still what does it imply
@ajaypratapsingh96262 жыл бұрын
Are we converting it into nfa Because we are not showing all transitions?
@rohitippili38346 жыл бұрын
Thank you 🙏🏼
@jyothijyo64093 жыл бұрын
Sir can't we put the self loop for final state in the example 3
@adityaaryan2412 Жыл бұрын
We can't as if we end the string with a 'b' that string would still get accepted which is wrong
@Birabhadra1234.3 жыл бұрын
As we know that for n, no. Of input alphabet there are nth no. Of ways from one state to another
@dhanushsivajaya13564 жыл бұрын
Thankyou sir
@afraimlevi98713 жыл бұрын
Thanks Alot
@gedelasivakrishna3 ай бұрын
Thankyou !!
@tarekrahaman9321 Жыл бұрын
Design DFA over an alphabet = (a,b), so every string accepted must end with 'aa,bb,aba' Please solve the question
@jamilafathima5 жыл бұрын
Hello sir Good explanation video Thank you so much, kindly do videos for database , im preparing for gate exam (self preparation) do the needful sir
@elishauppalapati10 ай бұрын
In 3rd example at B state we can loop bc?
@koteswaripeddinti70895 ай бұрын
construct a nfa-epsilon either a or abb or a* b+ Sir can you solve it
@deekshudeekshitha983510 ай бұрын
for RE 2 why "abbc" is not accepted by that machine?
@AhamedKabeer-wn1jb4 жыл бұрын
Thank you..
@mechanicalengineering7554 Жыл бұрын
what is the fa if the expression is like "a/b" please explain this
@yas-sinesl9105 Жыл бұрын
If (a+b) is a or b , then what does (a|b) means ?
@aakash95794 жыл бұрын
can't the third case can be done with the help of two state as 2nd state having loop
@aakash95794 жыл бұрын
got it concatenation introduce a new state
@taibamalik8114 Жыл бұрын
Why we don't use self loop for bs in a(bc)*
@macromed20232 ай бұрын
I won't be a dfa
@theonlyarjun7 жыл бұрын
in 3rd example. can't we self loop on state b with b,c ?
@TheKrish2077 жыл бұрын
Arjun Manoj same doubt
@sotsnein38737 жыл бұрын
No, you can't use a self loop with b, c as b,c stands for b+c. In this case, there is a concatenation of b and c(b.c).
@ChristianBurnsShafer6 жыл бұрын
No, that would accept the string 'ab' for instance.
@ChristianBurnsShafer6 жыл бұрын
GeishaTheSerpantClan is an idiot that wets their pants at night.
@joydeepmukherjee82636 жыл бұрын
Self loop will accept these strings: abcc, abbc, abcbbc, .... so on. The point is that, self loop can't impose the sequence b->c
@maryamriaz9001 Жыл бұрын
why we didnt apply the loop to bc?in last example
@arpanasingh99597 жыл бұрын
Can u solve this solution (11+110)*0
@utkarshhh73 жыл бұрын
Very tough
@buzzfeedRED6 жыл бұрын
My doubt is Can we take a self loop over state B as (bc) as one input Because we have (bc)* , so we can do it ?????????? Reply PLease
@RahulMadhavan6 жыл бұрын
the alphabet doesn't contain bc, only {a,b,c} so you need to keep a new state to transition through
@suvenduhatua_17544 жыл бұрын
@@RahulMadhavan if i only give b,c as an inputs to State B as a self Loop....then what is the problem???... Please reply.
@RahulMadhavan4 жыл бұрын
@@suvenduhatua_1754 I don't think i understand your question because i've lost context. Any case, here's my understanding of the question. For the third question in the video, you are proposing a state A and a state B. State A transitions to state B on input 'a', and state B self loops on the inputs 'b', or 'c'? You then propose B as the terminal state. Is this understanding correct? If so, then it has a clear disproof. Your automaton would accept input ab, which it should not.
@ektasrivastava86515 жыл бұрын
sir , is this thompson's construcion method ?
@scaldbox74427 жыл бұрын
I thought(a+b)c meant, one or more occurrences of 'a' followed by 'b', followed by 'c'
@ChristianBurnsShafer6 жыл бұрын
Only if the '+' is superscript. At least, in the context of this lecture series.
@mohanmahanty96196 жыл бұрын
Hello Scald Box,if it is (a+b)c,means there is a path from one state to another by a or b and then we can reach to next state by c,that means (a or b) followed by c
@aryandeshpande12412 жыл бұрын
dont you have to define every state transition over every state? in Q1, you defined over state a only transition 'b'
@Karim-nq1be Жыл бұрын
Its says Finite Automata not Deterministic Finite Automata.
@kingzai13147 жыл бұрын
thanks
@mdashamimad7728 Жыл бұрын
For the second expression if the input is ca thn????
@sudhanshupal44276 жыл бұрын
Thanks a lot!!!!!!!
@5430amit6 жыл бұрын
Thanks from IIIT_Kalyani :)
@CSELTADEPALLIDATTASRISAIRAM4 жыл бұрын
why cannot we put b,c in self loop to B??
@Sabidha-xv6lpАй бұрын
How to take a state as final state
@kartikaymehrotra6697 Жыл бұрын
can we have a self loop at B for input a,b?
@kartikaymehrotra6697 Жыл бұрын
in q c
@manikanta-oh3qy7 жыл бұрын
sir why r u not upload the design of amplifier in analog electronics
@sidreign30956 жыл бұрын
can you self loop B with bc as input?? 3rd example
@biswarupchakraborty56086 жыл бұрын
Buddha_ reincarnated No that will accept ab or ac too.
@arpanasingh99597 жыл бұрын
In third example were is ur self loop for closure?
@ChristianBurnsShafer6 жыл бұрын
Close of a concatenation requires (at least) two states.
@GOLDENBOYRICHIE5 ай бұрын
Where do you get the c from
@endone3661 Жыл бұрын
what does this use for ?
@mubashirayub66304 жыл бұрын
can you please make DFA of my RE which is: a ( ab + b )* bba ( a + b )
@chetanyasaini38993 жыл бұрын
Kaise kiya 1 saal hogya ab
@tanmayphalke6251 Жыл бұрын
Kaise kiya 3 saal hogaya ab aur@@chetanyasaini3899 apko 2 saal...🤣🤣
@iconicillustrations6853 Жыл бұрын
8:15
@sumitgaur20102 жыл бұрын
please help creatin dfa for "a*a" or how we can simplify the RE
@birajpaul40602 жыл бұрын
self loop with input 'a' on state A and out transition with input 'a'-> towards final state B
@sonit9707 Жыл бұрын
@@birajpaul4060 That's not a dfa.
@sonit9707 Жыл бұрын
@@birajpaul4060 Just the self loop should work.
@thewaveclasses77407 жыл бұрын
please sir signal and system ka aur video uplod ker dijiye
@nanitechinfo61887 жыл бұрын
write regular expression that derives all strings if a's and b's where every string contains substring ab as substring?
@nikhilnambiar71607 жыл бұрын
(a+b)^*ab(a+b)^*
@ViralVideoCreator5 жыл бұрын
Where is prvious lecture
@sheerazamushtaq3686 жыл бұрын
Where r rules for this sir?...in which lecture
@kalpesh76686 жыл бұрын
prior to this video , #54 video
@Birabhadra1234.3 жыл бұрын
1st finite automata graph is wrong because there are only one path from A to B not the other path for going a, alphabet fromA to B
@MohamedOsman-xk3xe6 жыл бұрын
if my input became what happen in example one
@alimoosawi43012 жыл бұрын
i love u
@muskansrivastav60233 жыл бұрын
Can anyone solve this....(alb)l(ab)*(bla)*(bb)*..... urgent please
@GOLDEN-wq8uz2 жыл бұрын
2 is incorrect, + means 1 or more times, what if we wanted to put in more than 1 a or b
@nonbeliever50274 ай бұрын
It is correct
@sireesharani63143 жыл бұрын
There is no keypoints for how to solve those sums ...he just solved the particular sums ...there is no subject foro how to solve any problem in regular expression..