Automata Theory

State Assignment for a Finite Automaton with Simplification of Logic Converter

V. V. Sapozhnikov, Vl. V. Sapozhnokov


Abstract: State assignment algorithms are proposed for an asynchronous finite automaton (AFA) that yields a simplified structure for the logic converter by reducing the functional dependence among internal variables. The algorithms are based on the Liu–Sagalovich method [C. N. Liu, J. Assoc. Comput. Mach., 10, No. 2, 209–216 (1963), Yu. L. Sagalovich, Probl. Peredachi Inf., 3, No. 2, 73–85 (1967)].

UDC: 621.391.1, 62-507

Received: 26.01.1976
Revised: 08.07.1976

 English version: Problems of Information Transmission, 1977, 13:4, 296–303

Bibliographic databases:

• 
•