An Algorithmic Approach to Sequential Automata Design

摘要

The economical design and implementation of sequential networks is the object of much of sequential automata theory, but no generalized solution insuring minimum cost has yet been developed in the theory. Several techniques for cost reduction have been presented in the literature; the majority of these techniques, however, are concerned with special classes of automata. Developed in this work is an automated procedure for sequential network design that uses economizing methods applicable to any general state table. Major emphasis is placed on relatively small subsystem-type automata rather than large systems of such complexity that excessive computer capacity and usage are required. Evidence as to the 'goodness' of the procedure is presented from a comparison with the results of other techniques. (Author)