Uniform modular realization of sequential machines

Authors:
Edward P. Hsieh;C. J. Tan;Monroe M. Newborn
Affiliations:
-;-;-
Venue:
ACM '68 Proceedings of the 1968 23rd ACM national conference
Year:
1968

Citing 4
Cited 3

Derivatives of Regular Expressions

Journal of the ACM (JACM)
Asynchronous Sequential Switching Circuit

Asynchronous Sequential Switching Circuit
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines

IEEE Transactions on Computers

Universal Modular Trees: A Design Procedure

IEEE Transactions on Computers
Modular Networks and Nondeterministic Sequential Machines

IEEE Transactions on Computers
A Study of Trigger Machines

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

Several researchers have investigated the problem of using a finite set of sequential modules to realize a given synchronous Moore machine.1,2,3 It has been shown that there does not exist either a single module or a finite set of modules that is logically complete for synchronous sequential machine design.3 That is, no finite number of identical copies of one module or finite set of modules can be used to realize with unit delay any arbitrary synchronous sequential machine. However, it has been shown that for every integer n, a finite number of identical copies of one module is sufficient to realize every n-input synchronous machine.2,3 It is the purpose of this paper to investigate this form of machine realization for both synchronous and asynchronous machines.