The completeness criterion for some systems containing P-sets of automaton functions
A. A. Rodin · Discrete Mathematics and Applications · 2013
A class of subsets (P-sets) in the functional system of automaton functions is considered. These P-sets are defined using the Post classes. The paper is devoted to the construction of efficient completeness criteria for infinite automaton function systems M such that N ⊆ M,M \ N is finite and N is a P-set. The criterion should determine whether the system is complete via a finite set M \ N. A number of decidable cases are presented.