In minimizing DFA, first we need to remove the non-reachable state, in this example state D is non -reachable state. So we need to remove D. so that in the final transition diagram, state DF is not possible.
@@WELCOMEENGINEERS Thanks for replying akkka Ennum konjam topics miss aguthu akka please antha topics ellam sethi oru video podunga exam date vera soliyachu akka plzzz......!
@@WELCOMEENGINEERS akka naan ungaluku syllabus annupurean apart from the playlist topics konjam upload pannunga akka UNIT-I Automata Fundamentals: Introduction to formal proof- Additional forms of Proof Inductive Prools - Finite Automata - Deterministic Finite Automata - Non-deterministic Finite Automata - Finite Automata with Epsilon Transitions (Chapter - 1) UNIT-II Regular Expressions and Languages Regular Expressions - FA and Regular Expressions - Proving Languages not to be regular Closure Properties of Regular Languages - Equivalence and Minimization of Automata (Chapter-) UNIT- III Context Free Grammar and Languages CFG-Parse Trees - Ambiguity in Grammars and Languages - Definition of the Pushdown Automata-Languages of a Pushdown Automata -Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata. (Chapter-3) UNIT-IV Properties of Context Free Languages Normal Forms for CFG- Pumping Lemma for CFL Closure Properties of CFL - Turing Machines- Programming Techniques for TM. (Chapter-4) UNIT-V Undecidability Non Recursive Enumerable (RE) Language - Undecidable Problem with RE- Undecidable Problems about TM - Post's Correspondence Problem. The Class P and NP. (Chapter-5)
@@WELCOMEENGINEERS thank you mam actually i have a compiler design xam tmrw in that also a topic of minimizing dfa is there but i learn toc topic mam 😂 naalaiki intha qn ah compiler qn la eluthuna ethum prblm varumaaa mam!!
When we consider input 0, the states d and f give another group C (that is final ) is the output.Both are goes to final group C when we consider the input zero.Hence we take D and F as separate group.We write it as pi new =(ABEGH)(DF)(C)
Mam transition table la E ..input la FH varathu mam HF tha varum aprm bracket curly braces maathi poturukiga mam ... always very good 👍
In minimizing DFA, first we need to remove the non-reachable state, in this example state D is non -reachable state. So we need to remove D. so that in the final transition diagram, state DF is not possible.
Clear explain mam 🙏😊
@@Marty2k-d4n Thank you. Keep watching & support our channel by share our channel videos with your friends
Vera mari purichituuu🎉❤...enga clg la vecancy erukku plz come 🫴🏻🏃🏻♀️
Send your mail id
Unreachable state d remove pannala.
..?
Thank you 😊 mam ❤
@@Thirisha-b5e Welcome. Keep watching & support our channel by share our channel videos with your friends
Mam keep going mam. But one request.. Page bottom vara cover pani video podunga mam.. Mathapadi ellam fine
Thank you for your suggestion. Keep watching and support our channel by share our videos with your friends. Thank you 😊.
Mam there is a correction (trasition from E to 0 is H
and E to 1 is F ) ok mam. U corected that in next step
Your crt bro but
it is which subject,
compiler design or theory of compuation ?
Both subject have this problem
E FH illa mam HF thapa podu erukika mam
aama
Thanks mam❤
@@sudhar8579 Welcome. Keep watching & support our channel by share our channel videos with your friends
Elu balan 😮
nice keep going
Thank you so much. Keep watching and support our channel
Pro tip: watch movies on flixzone. Me and my gf have been using them for watching loads of movies recently.
@Grey Malachi definitely, I've been using Flixzone} for since december myself :D
@Grey Malachi yea, I have been using flixzone} for years myself :D
@Grey Malachi Yea, I've been watching on Flixzone} for months myself =)
Indha concept ah compiler design la write panlama
Ya
Mam step 1 la epdi ma qo ku (A) and F ku (C) nu find paninga mam???
Akka entha playlist full ah regulation 2013 odatha ethula irrunthu regulation 2017 ku varum ah
Sure.
@@WELCOMEENGINEERS Thanks for replying akkka
Ennum konjam topics miss aguthu akka please antha topics ellam sethi oru video podunga exam date vera soliyachu akka plzzz......!
@@dominicv3256 Can you mention your exam date and topics? I will try to upload.
@@WELCOMEENGINEERS akka naan ungaluku syllabus annupurean apart from the playlist topics konjam upload pannunga akka
UNIT-I Automata Fundamentals:
Introduction to formal proof- Additional forms of Proof Inductive Prools - Finite Automata - Deterministic Finite Automata - Non-deterministic Finite Automata - Finite Automata with Epsilon Transitions (Chapter - 1)
UNIT-II Regular Expressions and Languages
Regular Expressions - FA and Regular Expressions - Proving Languages not to be regular Closure Properties of Regular Languages - Equivalence and Minimization of Automata (Chapter-)
UNIT- III Context Free Grammar and Languages
CFG-Parse Trees - Ambiguity in Grammars and Languages - Definition of the Pushdown Automata-Languages of a Pushdown Automata -Equivalence of Pushdown Automata and
CFG, Deterministic Pushdown Automata. (Chapter-3) UNIT-IV Properties of Context Free Languages
Normal Forms for CFG- Pumping Lemma for CFL Closure Properties of CFL - Turing Machines- Programming Techniques for TM. (Chapter-4)
UNIT-V Undecidability
Non Recursive Enumerable (RE) Language - Undecidable Problem with RE- Undecidable
Problems about TM - Post's Correspondence Problem. The Class P and NP. (Chapter-5)
Exam : theory of computation
Exam date : jan 31
Unreachable state D remove pannala...mam
Mam epdi final state c nu solringa pls tell me mam
It's already given in the sum by denoting double circle
Thanks mam
@@mvppartheeofficial8850 Welcome. Keep watching & support our channel by share our channel videos with your friends
@@WELCOMEENGINEERS conversion of finite autumata to regular expression explain pangua mam
Regulation 2021 ku vruma
@@it_asmith1559 sure. Keep watching
Mam are you from mailam engineering college
@@arjunv.s312 no
E F 1 Kum H 0 Kum ponum mam
Super mam
Thank you.Keep Watching
Mam c epudi final state varum mam
Two round pannirntha final state bro and number la iruntha final number tha final state
mam why should u assign final state as c ???
Because in the given problem C is given as the final state
@@WELCOMEENGINEERS thank you mam actually i have a compiler design xam tmrw in that also a topic of minimizing dfa is there but i learn toc topic mam 😂 naalaiki intha qn ah compiler qn la eluthuna ethum prblm varumaaa mam!!
@@mdmusthaq2340In Both subject we have same procedure to solve this problem.
@@mdmusthaq2340 All the best👍
@@WELCOMEENGINEERS very thankyou mam incase the qn is asked tmrw am going to write wht u teached 😇 thnk you mam
Why D,F as seperate group??
When we consider input 0, the states d and f give another group C (that is final ) is the output.Both are goes to final group C when we consider the input zero.Hence we take D and F as separate group.We write it as pi new =(ABEGH)(DF)(C)
@@WELCOMEENGINEERS thanks
Mam your explanation is great but, can you explain in english mam its helpful to us.
Why not? Keep watching sister and support our channel by share our videos with your friends
@@WELCOMEENGINEERS
Ya mam i will share videos to my friends
Mam please uploade videos in english because we are from karnataka we cant able to understand tamil language properly
@@laxmimuttennavar3872 👍
@@WELCOMEENGINEERS thank you mam
❤❤
Keep watching😊 & support our channel by share our channel videos with your friends
Why u separate group for B,H D,E and E
Please mention your doubt clearly
Akka transition tabula state E inputs interchange pannirukinga
In 6: 48 y we need to choose c
Not in c we choose only final state
C is the final State for this problem so,we choose c
Mam F ku 0 to C and F ku 1 to G varum mam ninga maathi pottutinga mam
Ok thanks
Step 4 in next video 😂
Mam two final state vachu video podunga mam please
Change the music
E = (H) (F)
SAMLL MISTAKE
Nalaiku exam ah😂😂😂
Mam unga konjam kooda arive illaya , oru sum 2 videos ah podreenga , idhu romba thappu mam,
☺
Zero not cero
Directa answer solama fulla explainunga...
Keep watching brother😊
Part 2?
Part -2 is already uploaded