Automata

On the interdependence of the coverability relation and homomorphism in the case of deterministic automata

E. K. Kornoushenko

Moscow

Abstract: The necessary and sufficient conditions are found under which from the relation $A \leqslant B$ follows the existence of homomorphism of the automaton $A$ to the automaton $B$ and a procedure for finding this algorithm is described.

UDC: 007.52


Received: 02.02.1973

 English version: Automation and Remote Control, 1974, 35:3, 442–446

Bibliographic databases:

• 
•