Automata

An effective algorithm for minimization of circuit complexity for incompletely determined automata specified by nonbranching graphs

A. K. Grigoryan, L. B. Shipilina

Moscow

Abstract: An algorithm is proposed for minimizing the circuit complexity of incompletely determined automata specified by linear transition graphs. The algorithm is shown to be efficient and time saving.

UDC: 53.072:51:519.14


Received: 25.12.1978

 English version: Automation and Remote Control, 1980, 40:10, 1479–1487

Bibliographic databases:

• 
•