Structural Simplification of the Logic Unit of a Finite Automaton Whose States Are Assigned by the Columns of the Transition Table

The authors propose state assignment algorithms for an asynchronous finite automaton (AFA) that represent an extension of the Liu–Sagalovich method [C. N. Liu, J. Assoc. Comp. Mach., 1963, vol. 10, no. 2, pp. 209–216; Yu. L. Sagalovich, Probl. Inf. Trans., 1967, vol. 3, no. 2, pp. 56–64], the purpose being to simplify the structure of the logic unit. A necessary and sufficient existence condition for complete parallel decomposition of AFA is obtained.