|
Problemy Peredachi Informatsii, 1969, Volume 5, Issue 1, Pages 79–86
(Mi ppi1787)
|
|
|
|
Coding the States of a Finite Automaton
N. K. Nemsadze
Abstract:
The lower bound of the number $n$ of internal elements (storage elements) of an automaton is deduced, subject to the condition that the automaton is stable to critical race conditions and to defects in its internal elements. A simple method of coding the internal states of the automaton is given; it enables the lower bound to be attained in a number of cases. For other cases an algorithm for coding the internal states of the automaton is deduced in which, although $n$ attains a minimal value, the inspection is not the last item.
Received: 10.09.1966 Revised: 22.05.1968
Citation:
N. K. Nemsadze, “Coding the States of a Finite Automaton”, Probl. Peredachi Inf., 5:1 (1969), 79–86; Problems Inform. Transmission, 5:1 (1969), 65–70
Linking options:
https://www.mathnet.ru/eng/ppi1787 https://www.mathnet.ru/eng/ppi/v5/i1/p79
|
Statistics & downloads: |
Abstract page: | 640 | Full-text PDF : | 209 |
|