Geodesic
Finiteness of the set of automaton Post bases with a decidable completeness problem
Diskretnaya Matematika, Tome 10 (1998) no. 3, pp. 57-63
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The bases under consideration are those of the form $M=\Phi\cup\nu$, where $\Phi$ is a Post class and $\nu$ is a finite system of automaton functions. It is shown that the sets of Post classes $\Phi$ for which the completeness problem for $\Phi\cup\nu$ is solvable, respectively, the $A$-completeness problem for $\Phi\cup\nu$ is solvable, are finite. 
@article{DM_1998_10_3_a4,
     author = {D. N. Babin},
     title = {Finiteness of the set of automaton {Post} bases with a decidable completeness problem},
     journal = {Diskretnaya Matematika},
     pages = {57--63},
     year = {1998},
     volume = {10},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_3_a4/}
}
TY  - JOUR
AU  - D. N. Babin
TI  - Finiteness of the set of automaton Post bases with a decidable completeness problem
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 57
EP  - 63
VL  - 10
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_3_a4/
LA  - ru
ID  - DM_1998_10_3_a4
ER  - 
%0 Journal Article
%A D. N. Babin
%T Finiteness of the set of automaton Post bases with a decidable completeness problem
%J Diskretnaya Matematika
%D 1998
%P 57-63
%V 10
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1998_10_3_a4/
%G ru
%F DM_1998_10_3_a4
D. N. Babin. Finiteness of the set of automaton Post bases with a decidable completeness problem. Diskretnaya Matematika, Tome 10 (1998) no. 3, pp. 57-63. http://geodesic.mathdoc.fr/item/DM_1998_10_3_a4/