Complete system of equivalent transformations for two-tape automata with disjoint loops
Two-tape automata are considered such that their transition diagrams do not have intersecting loops. A system of equivalent transformations is described for these automata, and its completeness with respect to the set of the transformations is proved.
scientific article; zbMATH DE number 1551553