Geodesic
On the classification of Post automaton bases by the decidability of the $A$-completeness property for definite automata
Diskretnaya Matematika, Tome 22 (2010) no. 2, pp. 80-95

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

We consider systems of the form $M=F\cup\nu$, where $F$ is some Post class and $\nu$ is a finite system of definite automata. We divide the Post classes into those for which the problem of $A$-completeness of such systems of definite automata is algorithmically decidable and those for which the problem of $A$-completeness is algorithmically undecidable. 
@article{DM_2010_22_2_a6,
     author = {D. N. Zhuk},
     title = {On the classification of {Post} automaton bases by the decidability of the $A$-completeness property for definite automata},
     journal = {Diskretnaya Matematika},
     pages = {80--95},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2010_22_2_a6/}
}
TY  - JOUR
AU  - D. N. Zhuk
TI  - On the classification of Post automaton bases by the decidability of the $A$-completeness property for definite automata
JO  - Diskretnaya Matematika
PY  - 2010
SP  - 80
EP  - 95
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2010_22_2_a6/
LA  - ru
ID  - DM_2010_22_2_a6
ER  - 
%0 Journal Article
%A D. N. Zhuk
%T On the classification of Post automaton bases by the decidability of the $A$-completeness property for definite automata
%J Diskretnaya Matematika
%D 2010
%P 80-95
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2010_22_2_a6/
%G ru
%F DM_2010_22_2_a6
D. N. Zhuk. On the classification of Post automaton bases by the decidability of the $A$-completeness property for definite automata. Diskretnaya Matematika, Tome 22 (2010) no. 2, pp. 80-95. http://geodesic.mathdoc.fr/item/DM_2010_22_2_a6/