0:18 We cannot convert directly from Moore to mealy. 5:37 you no need to write the transition table also by seeing the diagram itself you can convert. Then according to the second statement, we can convert directly from Moore to mealy Right?.
Now i concluded its NOT WRONG. It's actually correct. The output we take in the directed edge of the mealy machine is of the,, next node's output of the moore machine. Ma'am is right.
0:18 We cannot convert directly from Moore to mealy.
5:37 you no need to write the transition table also by seeing the diagram itself you can convert.
Then according to the second statement, we can convert directly from Moore to mealy Right?.
Yes bro u can convert directly,but transition table mandatory to everything....
In Finite Automata with output,we don't write final state inside two concentric circle,is it true.But why
There is no final state in finite automata with output.
Looks like the answer is wrong...
@dahiya no its correct. Our understanding was wrong.
Output in the mealy machine state transition table is wrong.
Just Be careful guys.
Now i concluded its NOT WRONG. It's actually correct. The output we take in the directed edge of the mealy machine is of the,,
next node's output of the moore machine. Ma'am is right.
In inpute 1 state C output is b not 'a'
Thanks
Not so good ma'am