On Discrete-Time Polynomial Systems.

摘要

One of the concerns was to obtain finiteness conditions, for it is the belief that finite computational procedures are an essential goal of applied algebra. Finitely many inputs (which can be chosen quite arbitrarily) are sufficient to separate those states of a system which are distinguishable. An investigation is given concerning the conditions under which systems with the same external behavior are isomorphic.