The approximate- realization (A- realization) problem in class of linear automata functions (l.-a. functions) through sets containing essential function and all constants in the closure is solved. The algorithm of all constants A-realization examination through finite set containing an essential function is found. For nondegenerate sets with adder of l.-a. functions the equivalence criterion of A-closure and closure operators is found.

finite automata, linear automata function, closure, A-closure, realization, A-realization, complete system, adder, delay

Mathematical problems and theory of numerical methods