ON THE REALIZATION OF LINEAR AUTOMATA.
Abstract
The study deals with the synthesis of linear discrete systems, and it considers the cases in which the information of their internal structure is defined or remains unspecified. A linear system is one whose output is a linear function of either the input and the state or a finite number of past inputs and past outputs. Necessary and sufficient conditions for linearity of the flow table of a system are derived. The set of conditions for linearity leads to a method for coding the set of output vectors of the system. Many special properties of the flow table of a linear system are found. Based on these properties, a synthesis procedure is established: it begins with the testing for linearity of the flow table of a system and ends with the construction of the behavior functions of the system. Both the Mealy and the Moore models are discussed in detail. The synthesis procedure is straight forward and in addition to being free of trial and error, it is also applicable to incompletely specified automata and singular systems. The optimization of the realization of linear automata is also discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1969
- Accession Number
- AD0693553
Entities
People
- Thomas J. Wey
Organizations
- University of Illinois Urbana–Champaign