학술논문

Every Finite-State Machine can be Simulated (Realized) by a Synchronous (Asynchronous) Binary Feedback Shift-Register Machine
Document Type
Periodical
Source
IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. C-23(2):174-178 Feb, 1974
Subject
Computing and Processing
Asynchronous realization, canonical forms, feedback shift register, finite-state machines, mictoprogramming, modular decomposition, state splitting, synchronous simulation.
Language
ISSN
0018-9340
1557-9956
2326-3814
Abstract
A theoretical model of a microprogram unit is formulated, and the relationship of this model to a form of feedback shift register is developed. The feedback shift-register machine variant has synchronous and asynchronous prototypes. The asynchronous binary feedback shift-register machines realize every fundamental mode asynchronous sequential (finite-state) machine. The synchronous feedback shift-register machine differs from the standard definition by the addition of transitional states to the usual (nontransitional) states, and a single step in the simulation is a move between nontransitional states. When synchronous feedback shift-register machines are generalized in this way, they also become universal components capable of simulating ali finite-state machines.