|
Problemy Peredachi Informatsii, 1982, Volume 18, Issue 3, Pages 74–84
(Mi ppi1238)
|
|
|
|
Automata Theory and Large System Science
Description of Cascade Networks of Finite Automata In Terms of Codings and Coverings
G. P. Agibalov, N. V. Evtushenko
Abstract:
The authors introduce the concepts of consistent codings and consistent systems of coverings of the set of states of a finite automaton. In terms of this concept, they characterize cascade networks of automata representing a given automaton, and particular cases of them, namely parallel-sequential, parallel, and sequential networks. They establish necessary and sufficient existence conditions for exact representations of an automaton by sequential and parallel-sequential networks, formulated in terms of embedded sequences of partitions of the set of states of the automaton.
Received: 27.11.1980 Revised: 22.02.1982
Citation:
G. P. Agibalov, N. V. Evtushenko, “Description of Cascade Networks of Finite Automata In Terms of Codings and Coverings”, Probl. Peredachi Inf., 18:3 (1982), 74–84; Problems Inform. Transmission, 18:3 (1982), 218–226
Linking options:
https://www.mathnet.ru/eng/ppi1238 https://www.mathnet.ru/eng/ppi/v18/i3/p74
|
|