Automata

A system of interconnected graphs as a model of complex finite automata

V. V. Rudnev

Moscow

Abstract: A description of the control algorithm for a digital plant (or a program in the case of software implementation of the algorithm) can be represented as a composition of simpler parts provided that a technologically explicit content of the parts is available, if the algorithm statements are successively implemented and uniformly encoded the complexity of hardware (or software) implementation is shown to be independent of the decomposition technique.

UDC: 62-504.72


Received: 22.01.1979

 English version: Automation and Remote Control, 1980, 41:3, 416–419

Bibliographic databases:

• 
•