%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