Advertisement

Abstract

The task of coding a finite automation consists in putting into correspondence with each input, output, and internal state a definite set of values of the basic input, output, and supplementary input signals respectively of the combinatory scheme (logical transformer). Automata coding is the least developed, although highly important, step in synthesis, determining reliability, stability, memory size, and complexity of the logical transformer (LT) [1].

Keywords

Internal State Input State Finite Automaton Memory Element Normal Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    M. A. Gavrilov, “Present state of the theory of relay devices,” in: Structural Theory of Relay Devices, Izd. Akad. Nauk SSSR (1963).Google Scholar
  2. 2.
    E.I. Piil’, “On the coding of internal states of a finite automaton,” Izv. Akad. Nauk SSSR, Tekhn. Kibernetika, No. 2 (1965).Google Scholar
  3. 3.
    E.I. Piil’, “Method of assigning internal states of an asynchronous finite automaton,” in: Principle of Constructing Control Networks and Systems, Nauka (1964).Google Scholar
  4. 4.
    Yu. L. Sagalovich, “A method of increasing reliability of finite automata,” in: Problems of Information Transmission, Vol. 2, Nauka (1965).Google Scholar
  5. 5.
    C. N. Liu, “A state variable assignment method for asynchronous sequential switching circuits,” J. ACM, Vol. 10, No. 2 (1963).Google Scholar
  6. 6.
    R. E. Stearns and J. Hartmanis, “On the state assignment problem for sequential machines II,” IRE Trans. on Electronic Computers, EC-10, No. 4 (1961).Google Scholar
  7. 7.
    J. Hartmanis, “On the state assignment problem for sequential machines,” IRE Trans. on Electronic Computers, EC-10, No. 2 (1961).Google Scholar
  8. 8.
    M. C. Paul and S. H. Unger, “Minimizing the number of states in incompletely specified sequential switching functions,” IRE Trans. on Electronic Computers, EC-8, No. 3 (1959).Google Scholar
  9. 9.
    J. Hartmanis, “Symbolic analysis of a decomposition of information processing machines,” Information and Control, Vol. 3, No. 2 (1960).Google Scholar

Copyright information

© Consultants Bureau, New York 1969

Authors and Affiliations

  • E. I. Piil’

There are no affiliations available

Personalised recommendations