Geodesic
On the completeness of systems of finite automata
Diskretnaya Matematika, Tome 9 (1997) no. 2, pp. 74-78

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

For an arbitrary alphabet $A$, we construct a recursive set of bases of automata with a single output and no more than two inputs, with algorithmically unsolvable completeness problem. The result is final, because the bases of automata with a single input and single output are incomplete. 
@article{DM_1997_9_2_a6,
     author = {V. A. Orlov},
     title = {On the completeness of systems of finite automata},
     journal = {Diskretnaya Matematika},
     pages = {74--78},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {1997},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1997_9_2_a6/}
}
TY  - JOUR
AU  - V. A. Orlov
TI  - On the completeness of systems of finite automata
JO  - Diskretnaya Matematika
PY  - 1997
SP  - 74
EP  - 78
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1997_9_2_a6/
LA  - ru
ID  - DM_1997_9_2_a6
ER  - 
%0 Journal Article
%A V. A. Orlov
%T On the completeness of systems of finite automata
%J Diskretnaya Matematika
%D 1997
%P 74-78
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1997_9_2_a6/
%G ru
%F DM_1997_9_2_a6
V. A. Orlov. On the completeness of systems of finite automata. Diskretnaya Matematika, Tome 9 (1997) no. 2, pp. 74-78. http://geodesic.mathdoc.fr/item/DM_1997_9_2_a6/