0
\$\begingroup\$

I want to draw a state diagram of a Mealy synchronous state machine having a single input x, and a single output y, such that y is asserted if the total number of 1’s received is a multiple of 3.

But the problem is how to get a multiple of 3 only with one input and one output ??

Help appreciated

\$\endgroup\$
7
  • \$\begingroup\$ Does n`t this mean "If the input sequence is 1 then 1 then 1 assert Y" ? \$\endgroup\$
    – Elbehery
    Dec 6, 2016 at 11:41
  • \$\begingroup\$ Do you think the problem is to determine if a binary number is divisible by three or is it to determine if the number of 1s in a string adds up to 3, 6, 9, etc.? As an example 7 has three 1s in it but is not divisible by 3. Which is it? \$\endgroup\$
    – owg60
    Dec 6, 2016 at 11:42
  • \$\begingroup\$ @owg60 not divisible it's multiple ( I don't the difference but it's not correct if it's divisible) the problem is how to draw it as for your Question the number of 1's is the matter for example 1 then 1 then 1 then y would be asserted cause it's multiple of 3 \$\endgroup\$
    – Rudy Al-3rowi
    Dec 6, 2016 at 11:52
  • \$\begingroup\$ Draw four state bubbles. Label the first one init, the second one, the third two, and the last three. From init transition to one if x is 1 otherwise stay in init. Do the same for one to two. Do the same from two to three but output is 1 on the transition. From three go back to one for x=1. Otherwise stay in three. If you post a picture, i'll let you know if it is right. \$\endgroup\$
    – owg60
    Dec 6, 2016 at 12:02
  • \$\begingroup\$ @owg60 here you go ( drive.google.com/file/d/0B0dJBo-zapNqNmt6YUp1a1pGMWc/… ) \$\endgroup\$
    – Rudy Al-3rowi
    Dec 6, 2016 at 12:31

1 Answer 1

Reset to default
2
\$\begingroup\$

Your attempt is close. Here is one way to do it;

Mealy

\$\endgroup\$
0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.