時序機線型實施之可行性

Abstract

A new approach is presented to determine whether a completely specified sequential machine can be realized by a linear machine, if state-splitting is permitted. A machine is found to be linearly realizable if we are able to construct a "standard array"from its flow table. The standard array provides the flow table of the linear machine pursued.The construction process involves mainly the interchange between rows and columns in an array and hence is feasible for both hand computation and computer program. This method can be applied to general sequential machines that do not require to be strongly-connected, with exactly two inputs, permutation machine, or autonomous machine. An extended result to deal with incompletely specified case is also provided.