Design a finite stat machine to determine whether tennary number divisible by 5

11kviews

written 5.7 years ago by

teamques10 ★ 65k

• modified 3.5 years ago

ADD COMMENT EDIT

1 Answer

1.2kviews

written 5.7 years ago by

teamques10 ★ 65k

A tennary system has 3 aphabets

$\sum ={0,1,2}$

Base of tennary number is 3

There are 5 possible remainder on divide by 5

20 state associated with 0

21 state associated with 1

22 state associated with 2

23 state associated with 3

24 state associated with 4

enter image description here

State transition …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.