The laterality problem for non-erasing Turing machines on is completely solved
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 159-204
Cet article a éte moissonné depuis la source Numdam
@article{ITA_1997__31_2_159_0,
author = {Margenstern, Maurice},
title = {The laterality problem for non-erasing {Turing} machines on $\lbrace 0,1\rbrace $ is completely solved},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {159--204},
year = {1997},
publisher = {EDP-Sciences},
volume = {31},
number = {2},
mrnumber = {1462585},
zbl = {0878.68063},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1997__31_2_159_0/}
}
TY - JOUR AU - Margenstern, Maurice TI - The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1997 SP - 159 EP - 204 VL - 31 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1997__31_2_159_0/ LA - en ID - ITA_1997__31_2_159_0 ER -
%0 Journal Article %A Margenstern, Maurice %T The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1997 %P 159-204 %V 31 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1997__31_2_159_0/ %G en %F ITA_1997__31_2_159_0
Margenstern, Maurice. The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 159-204. http://geodesic.mathdoc.fr/item/ITA_1997__31_2_159_0/
