Abstract:
The paper is concerned with $n$-ary linear sequential machines (LSM). Basic modular polynomial equations (MPE) are obtained for their design. MPE solvability is investigated as in the potential of a closed-loop system. Examples of an LSM transfer function optimal in terms of minimal time for completion of the transient process are given.