×

zbMATH — the first resource for mathematics

Finite automata. II. (English. Russian original) Zbl 0096.33102
Autom. Remote Control 21, 248-254 (1960); translation from Avtom. Telemekh. 21, 359-368 (1960).
Summary: In the second part of the paper [Part I, Autom. Remote Control 21, 156–163 (1960); translation from Avtom. Telemekh. 21, 224–236 (1960; Zbl 0097.12302)] there is again described the authors’ viewpoint on finite automata, on the problems of the theory of finite automata and on the interrelationships of this theory with the theory of the relay circuits (of the switching circuits in particular).
The paper poses the general problem of constructing automata of given time pace which consist of elements operating with different time pace. As an example of such a system abstract neurons (of McCulloch and Pitts neuron type) and neuron nets are considered. Switching circuits and relay circuits in general appear then as one of possible technical realizations of an abstract neuron net.

MSC:
68Q45 Formal languages and automata
Keywords:
finite automata
PDF BibTeX XML Cite
Full Text: MNR