Conversion of Mealy Machine to Moore Machine (Using Transition Table)
ฝัง
- เผยแพร่เมื่อ 4 ก.ย. 2024
- TOC: Conversion of Mealy Machine to Moore Machine (Using Transition Table)
This lecture shows how to convert a given MEALY MACHINE to its equivalent MOORE MACHINE using Transition Table.
Contribute: www.nesoacademy...
Website ► www.nesoacademy...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
• Axol x Alex Skrindo - ...
I just gave my exam, and was able to solve with the help of your video. Thanks
Sir, when we draw the state diagram, the state Q2 is isolated. So how will the sequence reach Q2? as there is no continuation from any other states to Q2.
It's clarity...Great job nd thank you sir...
such an amazing tutorial. Thank you so much sir. I am never going to forget this method in my life.
bhai itna bhi kya hi smjh aagaya?
chlo btao what is turing machine
Interesting thing in this question is, there is no way to reach q2 state in mealy machine (or q20 and q21 states in moore machine). Not only we can reach them but also, they are confined within themselves. So, my final question is, should we discard this state in final answer? Or should we keep it as it is in mealy machine?
we are supposed to keep them io think
same doubt i m having when i tried to draw the mealey machine using the transition table... q2 state is only called by itself with no link to others states
@@gorkijatt7679 yeah bro
I think we should discard it. In one of the previous DFA lesson identical case was discussed and we removed such state. Moore / Mealy machines are something like an extended type of DFA, so same logic should work.
Also if we look at this situation with few examples at hand, both machines (with q2 and without it) will give the same result, so q2 have nothing to do here.
Apke lecture hai to automata me pass hona mumkin hai😄😄😄💋💋💋💋
Khoop chhan 👌👌I understand it very well
finally i scored such a good marks all credit goes to you sir thank you
Thanks for explaining in a simple and efficient way 😘😘😘
One thing missed!!!......if ur initial state is returning output 1...that means it can accept a zero length or null length sequence.......which is wrong....so u need to add a new state...say Q..on top of q0 that will have same state transitions as q0 but it's output would be 0.....that means...on top of the table ..u will add Q state with.....row values ...q3 ..and q11...and 0
Means? I did not understood!
Moore machine cannot give output on initial state hence add a new initial state having output 0
No bro you are wrong.see the introductory video of moore machine carefully.moore machine can have output without any input and that is not wrong.
@@jayparekh7598 no
exactly @@jayparekh7598
ur explanation is very clear and easy to understand ..its very helpful...thank u
Great job sir thanks
But while drawing the transition diagram there is no connection between q2 and all remaining states ..
such an amazing tutorial. Thank you so much sir.
If we construct the mealy machine of the given table then I think there's a problem in state of q2 as it is isolated
why??????
Great superb sir for clarity
Thank you so much 😊❤
When we design the state diagram for this..q20 and q21 are forming a seperate diagram i.e. no connection to rest of the diagram???????
thats true q2 is unreachable state
yes ame doubt but now lol
Thank you 😊
thank you! well explained
. the only video that I understood
when i making transition diagram q20 and q21 are not linked to any state sois it unreachable state??????
Thanks for reuploading thiz 🤗
you guys are doing awesome work !
Super sir this lecture video ..I prepared for sem exam easily
Really it's great...sir ..easy to understand
Thank you
Thank you sir.This helped me a lot.
Very neat and clean explaination
Wow! easy explanation
Thank you wonderful lecture
Thanks u sir !! May God bless you
Superb Lecture !!!!! Keep it Man !!! Amazing
Love you 😘
if the starting state split up into two while conversion from mealy machine to moore machine then what will be the starting state for equivalent moore machine??
Thank you! Very easy to understand when you expalin it like this.
If output is not given for any state then what will we consider 1 or 0
there will always be an output given. that is what a mealy machine is. hope this helps.
One of the best academy
Great .. thank you soo much
Tq very much sir
I understood very clearly
Thanks bro
Easy because of u❤️❤️
Suppose we need to create 2 states for q00 and q01; now q0 was the initial state now which one should be initial state among q00 and q01
It doesn't matter. You can start at either one and it will result in the same output (except for the first symbol).
तुम्ही खरंच खूपच छान शिकवता sir
Sir when state nor present in that transition what is the procedure
Thank you so much...
How you connecting q2 in diagram
Thanks my sir so it is best
You saved me Sir..
Easy explanation sir
Well done
I really get all that you explained.
thanks man, will help me a lot in tomoros tst
But Sir Moore Machine must have an initial state yeilding 0, and new state must be introduced in order to do so...
If the starting state is split,then in the final moore machine,which of them will become the initial state.
for this table neither mealy or morre machine possible because q2 is isolated from rest of the states. please explain if i am wrong
No bro its true as per my knowledge bcz moore and mealy m/c DFA nature and DFA can exist of isolated states also so its true
reis allah razı olsun bundan sonra sizin videoları görünce hemen atlamayacağım.
"şüphesiz ki, hindular dünyaya ders anlatmak için yollanmışlardır."
Ur the best.... U helped me alott with all my doubts...
U have to explain the very good sir
thank you sir 👍👍👍
Thank you.
Thank u sir
Really very helpful...thanku so much
If i not removed the outputs is it right?
very good explanation Sir!
fantastic .....
Sir i have questions how can i remove the transition from the table (a,b) 😂
the only video that make me understand(out of 4)
thank you so much sir...........for this video.........
pls design it into transition diagram
Transition diagrams have design limitations, whereas transition functions do not. So, it is worthwhile to be able to perform these operations without the use of a diagram.
Nice explanation sir 👌👍
Minimization of finite automata with output
So we'll explained I understood you
Q2 is only Reachable by Q2 LOL
If we draw it Q2 is separate Machine
why tell now on using the fsm with output we dont determine the final state ?! is that because we dont need one to be our final state and the string will follow the state and outputting the result and if we find what we construct our machine for that mean the string is meeting our condition
Excellent.
hats off to you sir , you really saved my life xD
sir is turing machine is the upcomping topic ???
Thank you sir.....
thanku very much
Best !! Video
faadu hai boss tu
i definitely get 5 marks .because tomorrow is my xam and i am reading this first today.
5:27 q2 = cutoo 🤣
my god fr fr
You are God sir
q21 = 0 and q20 = 1 İsn't this true ?
I have the same question 🙄
q2 is split into two, so one giving output 1 is named q21 and one giving output 0 is named q20 just last subscript is written based on output
I graudated from university but thanks
Yep afterall three years later haha
I was studying for my exam thought of answering XD
Haha
look
noiceeeeeee
Osm
nice
BKwas
?????????????
👏🏻👍🏻👍🏻
Overrated in whole TH-cam 🎉 one night batting
የሰሰሰሰሰሰሰ
Kch smjh nhi aaya😐😐😢😢
Thank you
Thank you soo much sir.
Thank you so much
thank u.. Very good explanation
thank you