Realization of Input-Output Relations by Sequential Machines

Authors:
A. Gill
Affiliations:
Department of Electrical Engineering and Electronics Research Laboratory, University of California at Berkeley
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 0
Cited 3

Speeding up the Synthesis of Programs from Traces

IEEE Transactions on Computers
Sequential Machine Identification

IEEE Transactions on Computers
A solution of the syntactical induction-inference problem for regular languages

Computer Languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the synthesis of sequential machines (without a distinguished initial state) which satisfies a specified list of input sequences and corresponding output sequences. Readily testable necessary and sufficient conditions are given for such a list to result in a realizable machine, and an algorithm is formulated for constructing the machine when these conditions are fulfilled.