TY  - JOUR
AU  - D. N. Babin
TI  - Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
JO  - Diskretnaya Matematika
PY  - 2003
SP  - 110
EP  - 130
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2003_15_1_a5/
LA  - ru
ID  - DM_2003_15_1_a5
ER  -