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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature Cited
M. A. Gavrilov, “Present state of the theory of relay devices,” in: Structural Theory of Relay Devices, Izd. Akad. Nauk SSSR (1963).
E.I. Piil’, “On the coding of internal states of a finite automaton,” Izv. Akad. Nauk SSSR, Tekhn. Kibernetika, No. 2 (1965).
E.I. Piil’, “Method of assigning internal states of an asynchronous finite automaton,” in: Principle of Constructing Control Networks and Systems, Nauka (1964).
Yu. L. Sagalovich, “A method of increasing reliability of finite automata,” in: Problems of Information Transmission, Vol. 2, Nauka (1965).
C. N. Liu, “A state variable assignment method for asynchronous sequential switching circuits,” J. ACM, Vol. 10, No. 2 (1963).
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).
J. Hartmanis, “On the state assignment problem for sequential machines,” IRE Trans. on Electronic Computers, EC-10, No. 2 (1961).
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).
J. Hartmanis, “Symbolic analysis of a decomposition of information processing machines,” Information and Control, Vol. 3, No. 2 (1960).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 Consultants Bureau, New York
About this chapter
Cite this chapter
Piil’, E.I. (1969). Certain Questions in the Coding of Finite Automata. In: Lazarev, V.G., Zakrevskii, A.V. (eds) Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9033-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9033-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-9035-0
Online ISBN: 978-1-4684-9033-6
eBook Packages: Springer Book Archive