Geodesic
Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
Diskretnaya Matematika, Tome 15 (2003) no. 1, pp. 110-130

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider automaton bases with complete Boolean part. We construct an algorithm to test completeness of such bases and give upper bounds for its complexity. 
@article{DM_2003_15_1_a5,
     author = {D. N. Babin},
     title = {Efficient recognition of the completeness of a system of automaton functions with a complete {Boolean} part},
     journal = {Diskretnaya Matematika},
     pages = {110--130},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2003_15_1_a5/}
}
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  - 
%0 Journal Article
%A D. N. Babin
%T Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
%J Diskretnaya Matematika
%D 2003
%P 110-130
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2003_15_1_a5/
%G ru
%F DM_2003_15_1_a5
D. N. Babin. Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part. Diskretnaya Matematika, Tome 15 (2003) no. 1, pp. 110-130. http://geodesic.mathdoc.fr/item/DM_2003_15_1_a5/