Construction of Moore Machine (Example 1)

preview_player
Показать описание
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}

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

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!

alex_inside
Автор

you make all of it look so simple, keep going

king_kalindi
Автор

Sir you are a true gem .Thanks for such good explanation 🙌

manasimandlik
Автор

I have no words... Thank you so much...

MeraAllah
Автор

Oh my God that DFA Explanation was so good!
Thank you so much sir!

divyaanshuagrawal
Автор

Amazing. May Allah(SWT) reward you for this.

BukhariTechnologies
Автор

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'

geetabadgujar
Автор

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?

reemagulmuhammad
Автор

@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 ^__^.

EasyHck
Автор

the last path from D->A for input b we could have make a loop on D also for the input b.

ghostrecall
Автор

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'.

akshaysubash
Автор

D on getting b can also goto state B, Right or wrong?

samreenasam
Автор

Sir, why dont we implement the moore machine for printing abb using 3 states A, B, C ?

sourabh
Автор

Is there any VHDL code "videos" in the channel related to finite state machine w/ outputs? this1

yahyaabulhaj
Автор

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?

فيافيالتأملمهمةإصلاح
Автор

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?

PRIdark
Автор

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

raguramsrikanth
Автор

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!

nikeshprasad
Автор

Can't we self loop input b for state D?

bikramnath
Автор

what if it was asked to detect the sequence aba?

swarna_jee