Geodesic
On two subclasses of Turing machines which can be reduced to finite automata
Doklady Akademii Nauk, Tome 187 (1969) no. 1, pp. 9-10.

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

@article{DAN_1969_187_1_a0,
     author = {Yu. Ya. Breitbart and V. A. Kozmidiady},
     title = {On two subclasses of {Turing} machines which can be reduced to finite automata},
     journal = {Doklady Akademii Nauk},
     pages = {9--10},
     publisher = {mathdoc},
     volume = {187},
     number = {1},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1969_187_1_a0/}
}
TY  - JOUR
AU  - Yu. Ya. Breitbart
AU  - V. A. Kozmidiady
TI  - On two subclasses of Turing machines which can be reduced to finite automata
JO  - Doklady Akademii Nauk
PY  - 1969
SP  - 9
EP  - 10
VL  - 187
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1969_187_1_a0/
LA  - ru
ID  - DAN_1969_187_1_a0
ER  - 
%0 Journal Article
%A Yu. Ya. Breitbart
%A V. A. Kozmidiady
%T On two subclasses of Turing machines which can be reduced to finite automata
%J Doklady Akademii Nauk
%D 1969
%P 9-10
%V 187
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1969_187_1_a0/
%G ru
%F DAN_1969_187_1_a0
Yu. Ya. Breitbart; V. A. Kozmidiady. On two subclasses of Turing machines which can be reduced to finite automata. Doklady Akademii Nauk, Tome 187 (1969) no. 1, pp. 9-10. http://geodesic.mathdoc.fr/item/DAN_1969_187_1_a0/