|
Avtomatika i Telemekhanika, 1981, Issue 9, Pages 143–150
(Mi at5915)
|
|
|
|
Automata
On an automation|system of interconnected graphs
G. I. Mikhailov Moscow
Abstract:
A general case of automaton system of interconnected graphs with connected states is described. Behaviour of such systems is described. Two systems are shown to be equivalent if the associated sets of superdense words are equal. Particular cases of systems are identified whose analysis by using superdense words is most effective.
Received: 29.05.1980
Citation:
G. I. Mikhailov, “On an automation|system of interconnected graphs”, Avtomat. i Telemekh., 1981, no. 9, 143–150; Autom. Remote Control, 42:9 (1981), 1250–1255
Linking options:
https://www.mathnet.ru/eng/at5915 https://www.mathnet.ru/eng/at/y1981/i9/p143
|
Statistics & downloads: |
Abstract page: | 78 | Full-text PDF : | 39 | First page: | 2 |
|