• DocumentCode
    1114478
  • Title

    Every Finite-State Machine can be Simulated (Realized) by a Synchronous (Asynchronous) Binary Feedback Shift-Register Machine

  • Author

    Levy, Leon S. ; Freeman, Martin

  • Author_Institution
    Department of Statistics and Computer Science, University of Delaware
  • Issue
    2
  • fYear
    1974
  • Firstpage
    174
  • Lastpage
    178
  • 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.
  • Keywords
    Asynchronous realization, canonical forms, feedback shift register, finite-state machines, mictoprogramming, modular decomposition, state splitting, synchronous simulation.; Chromium; Computational modeling; Computer science; Logic; Mathematics; Notice of Violation; Prototypes; Shift registers; State feedback; Statistics; Asynchronous realization, canonical forms, feedback shift register, finite-state machines, mictoprogramming, modular decomposition, state splitting, synchronous simulation.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1974.223881
  • Filename
    1672474