Conversion of Mealy Machine to Moore Machine (Using Transition Table)
Вставка
- Опубліковано 28 січ 2017
- 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.org/donate
Website ► www.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
• Axol x Alex Skrindo - ...
It's clarity...Great job nd thank you sir...
ur explanation is very clear and easy to understand ..its very helpful...thank u
I just gave my exam, and was able to solve with the help of your video. Thanks
such an amazing tutorial. Thank you so much sir.
Thanks for explaining in a simple and efficient way 😘😘😘
thank you! well explained
. the only video that I understood
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
Khoop chhan 👌👌I understand it very well
Thank you sir.This helped me a lot.
Superb Lecture !!!!! Keep it Man !!! Amazing
Thank you wonderful lecture
One of the best academy
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.
Very neat and clean explaination
you guys are doing awesome work !
Thanks for reuploading thiz 🤗
Really it's great...sir ..easy to understand
thanks man, will help me a lot in tomoros tst
Thank you 😊
Thanks u sir !! May God bless you
Thank you so much 😊❤
Thank you
Great superb sir for clarity
Great .. thank you soo much
You saved me Sir..
Thank you! Very easy to understand when you expalin it like this.
finally i scored such a good marks all credit goes to you sir thank you
Thank you soo much sir.
Easy explanation sir
Super sir this lecture video ..I prepared for sem exam easily
thank you sir 👍👍👍
Thank you so much...
Wow! easy explanation
fantastic .....
Tq very much sir
I understood very clearly
Thank you so much
Thank You
Thank you.
Thanks bro
thank you
Thanks my sir so it is best
Easy because of u❤️❤️
when i making transition diagram q20 and q21 are not linked to any state sois it unreachable state??????
Thank u sir
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.
Love you 😘
If i not removed the outputs is it right?
Sir when state nor present in that transition what is the procedure
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??
Ur the best.... U helped me alott with all my doubts...
If the starting state is split,then in the final moore machine,which of them will become the initial state.
Well done
I really get all that you explained.
Really very helpful...thanku so much
tqs sir
How you connecting q2 in diagram
तुम्ही खरंच खूपच छान शिकवता sir
very good explanation Sir!
thank u.. Very good explanation
But while drawing the transition diagram there is no connection between q2 and all remaining states ..
for this table neither mealy or morre machine possible because q2 is isolated from rest of the states. please explain if i am wrong
thank you so much sir...........for this video.........
U have to explain the very good sir
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
Apke lecture hai to automata me pass hona mumkin hai😄😄😄💋💋💋💋
Excellent.
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??????
Nice explanation sir 👌👍
the only video that make me understand(out of 4)
Best !! Video
Thank you sir.....
Sir i have questions how can i remove the transition from the table (a,b) 😂
thanku very much
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.
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.
But Sir Moore Machine must have an initial state yeilding 0, and new state must be introduced in order to do so...
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).
So we'll explained I understood you
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.
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."
Minimization of finite automata with output
faadu hai boss tu
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
hats off to you sir , you really saved my life xD
my god fr fr
Osm
noiceeeeeee
Q2 is only Reachable by Q2 LOL
If we draw it Q2 is separate Machine
nice
5:27 q2 = cutoo 🤣
i definitely get 5 marks .because tomorrow is my xam and i am reading this first today.
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
sir is turing machine is the upcomping topic ???
look
👏🏻👍🏻👍🏻
You are God sir
የሰሰሰሰሰሰሰ
BKwas
?????????????
Kch smjh nhi aaya😐😐😢😢
Overrated in whole UA-cam 🎉 one night batting