Undecidability of the completeness and {\it A}-completeness problems for some systems of automaton functions
Diskretnaya Matematika, Tome 7 (1995) no. 1, pp. 52-65
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_1995_7_1_a2,
author = {D. N. Babin},
title = {Undecidability of the completeness and {\it {A}-completeness} problems for some systems of automaton functions},
journal = {Diskretnaya Matematika},
pages = {52--65},
publisher = {mathdoc},
volume = {7},
number = {1},
year = {1995},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1995_7_1_a2/}
}
TY - JOUR
AU - D. N. Babin
TI - Undecidability of the completeness and {\it A}-completeness problems for some systems of automaton functions
JO - Diskretnaya Matematika
PY - 1995
SP - 52
EP - 65
VL - 7
IS - 1
PB - mathdoc
UR - http://geodesic.mathdoc.fr/item/DM_1995_7_1_a2/
LA - ru
ID - DM_1995_7_1_a2
ER -
D. N. Babin. Undecidability of the completeness and {\it A}-completeness problems for some systems of automaton functions. Diskretnaya Matematika, Tome 7 (1995) no. 1, pp. 52-65. http://geodesic.mathdoc.fr/item/DM_1995_7_1_a2/