Construction of Moore Machine (Example 1)
ฝัง
- เผยแพร่เมื่อ 28 ส.ค. 2024
- TOC: Construction of Moore Machine- Examples (Part 1)
This lecture shows how to construct a Moore Machine counts the occurrences of the sequence 'abb' in any input strings over {a,b}
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 - ...
My teacher gets paid to teach me this and does a horrible job, some guy across the world doesn't get a cent and explains this in such a simple manner that I wonder for what our teachers get paid. Thanks for the video!
well said
Just video alone get many cent per user, sometimes 3-4 ads per video >.
Technically he still gets paid through ad revenue, but its still not compared to what ur teacher might be earning coz Ads in India pay very less.
@@tanmaysingal2179 Social Blade figures are not trustworthy. How can one have such a large difference b/w min and max earning in a month?
@@shri1417 during exams i guess it goes up for each year
you make all of it look so simple, keep going
Sir you are a true gem .Thanks for such good explanation 🙌
I have no words... Thank you so much...
Amazing. May Allah(SWT) reward you for this.
@@swastikmohanty7370 SubhanawaTallah.
Oh my God that DFA Explanation was so good!
Thank you so much sir!
If we want to count the occurences of the sequence 'abb' then we need to construct DFA that contain substring 'abb' in it because in question there is not mentioned that we want sequence 'abb' in end
So instead of constructing DFA that end with sequence 'abb' we need to construct DFA that contain sequence 'abb'
Correct me if i was wrong
@@geetabadgujar2565in moore machine there is no final state so we use DFA that end with 'abb' , if we use DFA that contain 'abb' then it will increase the no. of states only
@@ashishyadav310 how will the number of states increase, In the mentioned example can't we just make a self loop at D for input a and b so. Our 'abb' will be included and all the strings can also be accepted that contain abb.
Example: Design Moore Machine having two pulse inputs x1, x2 and one level output z. z is to toggle with an x2 pulse immediately following at least two consecutive x1 pulses.
1. Design the machine given in the drill and write the excitation and output expressions.
2. Draw the schematic diagram of the system
3. Draw the timing diagram of the machine given in the drill
4. Write the names of different toolboxes that you have used to draw the schematic
diagrams?
May you please help me out in this question?
@Neso the way you explain things is cool. I hope if you can start a new Series of computer science categories for DBA ( Database Administration ) talking about Relational algebra, SQL, Decompositions, Normalization, DFs and DMs and so on .thanks this is only a suggestion from one of your subscribers ^__^.
Very well explained
the last path from D->A for input b we could have make a loop on D also for the input b.
Excellent tutorial.
Thankyou sir for this video
nice tutorial :)
Thank you sir 👍
Thank You💙
nice lecture
Thanks
Tqqq 😭
How does it counts the occurrences of "abb"? It just prints 1 when "abb" is encountered.
The question is wrong in this case I guess!
You count the number of 1's printed in the output, hence you get the count of the occurrences of abb.
Hrithik Naha Yes that's what I mean the difference between "You count" and "Machine counts". Anyways thanks for your reply.
@@nikeshprasad5559 Exactly, I was thinking I'll have to make the Moore machine output the binary of the number of occurrences.
D on getting b can also goto state B, Right or wrong?
Wrong
No then we dont get a
@@Nirajbhoirbut there is a self loop for a on state B
Sir I have a doubt, in state C if we get 'a' as input the machine should stay in state c itself right? because the pattern ab is already occured and the next requirement is only the occurance of 'b'.
Sir, why dont we implement the moore machine for printing abb using 3 states A, B, C ?
Hello, i have a problem with a moore machine where i have as inputs a,b,c and outputs 0,1. I need to have 1 when i have abca and also an even number of a, 0 otherwise. My problem is about the fact i have 3 kind of inputs(a,b,c) not just 2 like in your exemples(a,b). Any advices please?
if from state A to state B a is counted and D is the final state, doesn't that mean transition from D to A should make b counted which makes the machine count the occurrence of abbb?
The question want us to get 1 whenever we get the sequence abb, in the sequence abbb, you've already gotten the desired abb, so a 1 from first 3 character, in this design, you're allowed to get 1 more than once
@@yarenkaya7872 kind late bro, already forgot what this is about lol, but thnx anyway really appreciate
Nice sir
Thanks sir
Is there any VHDL code "videos" in the channel related to finite state machine w/ outputs? this1
Can't we self loop input b for state D?
Wouldn't that produce a string of 1s for the output until the next a is reached?
Sirrrrr youuu ❤
Hi sir good evening .how states are present in both moore and melay machine . My mam tolled N States in moore machine what about melay
greta wrk sir
Can we design more than 1 Moore machine for a same task?
I have designed a Moore machine for the above problem which is working correctly.
You must have done it with 3 states. Same here, seems correct.
yes you can
they are infinite
@@marcusshane however, i don't see how you can do this with just 3 states
none of them is redundant
I also made with 3 states . On C i made self loop if input is b and i think its's correct
@@AbhishekSingh-fo9nv no , that's incorrect
Who's watching from Pakistan 🇵🇰
can't we do this with nfa with out dfa
My dumb brain don't know how to start after reading the question 😭 what should I do
what if it was asked to detect the sequence aba?
Then you change the b to an a.
32
We only count the no of abb in the series 🙄
But by doing this we have given memory to fsm
actually no
if you were outputting stuff like 001002003 then yeah, but you aren't, it still doesn't know how many times it has outputted it, that part of the counting falls on your part.
Gd