Abstract:
The concept of an automata systems of interconnected graphs with simplest links is introduced which is a generalization of the concept of the symplest system of interconnected graphs. Equivalence and minimization of such systems are discussed.
Fulltext:
PDF file (1890 kB)