this guy is truly a savior......its just some 6hrs left for the exam now and I've covered the Conversion of regular expression to F.A and vice-versa just now.....your playlist is just damnnn supportive for students like us who sits just one day before exams.....Thankyou Neso academy.....Regards B.Sc student;
@@priyanshuchaudhary837 In proper terms, this NFA is wrong coz it has 1 extra unwanted state. For eg:- L = {a,b} is given by 2 edges from initial state A to final state B. A wrong answer wud be sending 2 edges with a and b to SEPARATE final states B and C. Here state C is UNWANTED..
NFA with states 1-5 and input alphabet {a, b} has the following transition table. Q δ(q, a) δ(q, b) 1 {1, 2} {1} 2 {3} {3} 3 {4} {4} 4 {5} Ø 5 Ø {5} a) Draw a transition diagram. b) Calculate δ*(1, ab). c) Calculate δ*(1, abaab). Plz solve
Why? It's already NFA and I'm not entirely sure, but doesn't epsilon-transitions only lead to unnecessary states? That's why you can always convert epsilon-NFA to normal NFA.
can we write something like a four state F.A. where A is the initial state, which goes on input 1 in B, and on 0 in D; B on input 0 in C(also finale state) and on input 1 to D; C doesn't go anywhere; D goes to itself on input 0 and to C on input 1. Would this work or not?
This FA isn't correct as the rules for constructing FA are not followed - There is duplication of inputs taking place and there're more than two inputs going out from the initial state (when there're only on inputs in the language).
this guy is truly a savior......its just some 6hrs left for the exam now and I've covered the Conversion of regular expression to F.A and vice-versa just now.....your playlist is just damnnn supportive for students like us who sits just one day before exams.....Thankyou Neso academy.....Regards B.Sc student;
This channel saved so many lives including mine who else with me !?👀 🙌🏻❤️
Still saving bro ✨🥺... 🛐
Elon musk is genius
Ya still
Y'all so cringe on TH-cam
Such an elegant and easily understandable explanation.
Thou art a life saver.
The best teaching method i have come across. Thanks a lot!
Mind blowing explanation sir.
The way your teaching is awesome
Shanumukh chaduvuko.
I love this channel .. too good explanation of all subjects..
very good and easy to understand..Please make these videos quickly so that I can cover TOC in this sem.
very nice lecture. your explanations are amazing
Great explanation 👍👍🙏
brilliant sir i love you
❤️Thank u very much sir...❤️
I LOVE THIS CHANNEL
Thank U
Can we eliminate D and add an edge from B to E on input 1?
yes u can,,,,,,turns out that wd be its minimization,,,,,,,,,,both are correct ,,,,,,
Yup, that's what I did. It's nice because you could see how minimization comes in handy.
@@ziliestarrive but how to minimize NFA because NFA can't be minimised
Absolutely
@@priyanshuchaudhary837 In proper terms, this NFA is wrong coz it has 1 extra unwanted state. For eg:-
L = {a,b} is given by 2 edges from initial state A to final state B.
A wrong answer wud be sending 2 edges with a and b to SEPARATE final states B and C. Here state C is UNWANTED..
i think this can be done using 4 states also
how?
In the case that a state has a Kleene operator on an expression, how does one break it down?
If we had (01)* how would you break it down?
Professor thank you . Now realy i understood this chapter..
I have a question: Q) can we make here 2 final state ?
Yes you can, FA can have two final states.
Nice Sir 😊
Can i eliminate the ‘D’ state by putting 1 in transition of ‘B’ state directly to ‘E’ state?
yup
Thank you so much!!! So easy to understand!!
Very good explantion..THank you..
Life savior ❤
Can you now upload more example of regular expression of F.A
My exam is like 6 hr thanks for everything
Thank you sooo Much 😌💓
SIR GEELIII PAPPIIII MERI TARAF SEE😘😘❤❤
can you provide solution for the expression (10+01)*0(001+011)* to DFA ?
Pls tell (0+1)*
@@yuvrajbansal6294 you know that you are 1 year late right?
how can we calculate the number of final states??....... In the previous lecture it was two final states then why can't be in this example??
Since in both examples automatas are not minimised so the number of final state is not fixed. Both are correct.
Can we make a Final state 'F' from E, instead of making 'C' as final state from 'E' to 'C'?
exactly what i was about to ask
NFA with states 1-5 and input alphabet {a, b} has the following transition table.
Q δ(q, a) δ(q, b)
1 {1, 2} {1}
2 {3} {3}
3 {4} {4}
4 {5} Ø
5 Ø {5}
a) Draw a transition diagram.
b) Calculate δ*(1, ab).
c) Calculate δ*(1, abaab).
Plz solve
Is the position of * correct in question
if 0* includes epsilon, then aren't we suppose make another state where it goes through epsilon?
No , we won't make another state for epsilon
Every state on eplison goes to itself. (previous rule)
thank u so much
E on getting null input won't go anywhere right? How is 0* valid
from state A, transition for 1 goes to b and also to d . So can this be a nfa?
Your channel is very interesting ...
What is the DFA from (ab)* + (a+b) (ba)*
Construct finite automata for the regular expression 0*+1*+2* ?
thank you
Thankyou sir
Is there any video on converting RE to (NFA with €-transition)...??
Same here
I also need
Why? It's already NFA and I'm not entirely sure, but doesn't epsilon-transitions only lead to unnecessary states? That's why you can always convert epsilon-NFA to normal NFA.
@@ziliestarrive???
Sir can we write (a+b)* = closure of state A with input a,b ?
Why there is only a single final state in this question.In the last example there was two final states.
Same question came in my mind!
@@lwe9140 He did not need two final states in the last example. He could have connected 5 and 4 for the same effect.
nice tutorial :)
Super sir
thanks a lot
is having a final state after E for "1" wrong ?
can we write something like a four state F.A. where A is the initial state, which goes on input 1 in B, and on 0 in D; B on input 0 in C(also finale state) and on input 1 to D; C doesn't go anywhere; D goes to itself on input 0 and to C on input 1. Would this work or not?
i believe the same , also the solution here can be wrong as there should'nt be 0* as epsilon can will also be there
i have the same doubt:)))
Why is "+" seen as "OR"? Isn't it 1...infinite (in RegEx)
God or whatt.
Shouldn't there b ebsilon in 0*
ありがとうございます
Arigato gojaimaj
khonni chuwa
It is better to do self loop in 2nd step
Wondeful!
೦* comes in loop sir but you take the next state transaction
This FA isn't correct as the rules for constructing FA are not followed - There is duplication of inputs taking place and there're more than two inputs going out from the initial state (when there're only on inputs in the language).
sir please upload the more example on this topic .please sir
can you provide solution of(0*/1*)*
how can generate from L((aa*)b)*)
How would we do (a* + b*)*
Tq sir
Give me best luck , I have exam's tomorrow & Idk anything about TOC😢😊
Pass or Fail?
@@MohammedAliKhan-mn7bz passed with A+ grade
This is nfa, not a dfa
how to solve these:
1. (10*+01*)11*
2. (0+1)*(01+1000)0*
Is it just me or does he sound more and more mallu as you increase the speed of the video??
lol, felt same
that's racist
nice
I think we can make this with 4
where were you
you dropped one state
yup
Nope
The final answer is correct
❤❤❤
ledgendary explanation
jaan bcha lii
its nfa :)
wow