Memory-Span Concepts and the Synthesis of Sequential Machines in Feedback Shift-Register Form

@inproceedings{Martin1967MemorySpanCA,
title={Memory-Span Concepts and the Synthesis of Sequential Machines in Feedback Shift-Register Form},
author={Robert L. Martin},
booktitle={SWAT},
year={1967}
}

Various procedures have long been known for synthesizing a sequential machine with a feedback shift-register if each state is to have exactly one assignment; however, these approaches fail if each state is allowed to have more than one assignment. Herein lies the equivalent-state problem. The equivalent-state problem is approached by establishing a relationship between feedback shift-register realizable flow tables and finite memory-span. From this relationship, a necessary and sufficient… Expand

The synthesis of sequential discrete systems involves two major steps: 1) the abstract synthesis that yields a state-transition diagram, and 2) the structure synthesis that yields a realization. The… Expand

The definitions of input-memory and output-memory of a sequential machine are examined and an attempt is made to clarify some, confusion in the literature regarding the concepts of input-memort and… Expand

Any flow table M, which describes the circuit action of a normal fundamental mode asynchronous sequential circuit, can be realized as a fundamental mode circuit with feedback index [log 2 S], where S is the maximum number of stable states in any input column of M.Expand