Geodesic
Deciphering of sequential networks in the absence of an upper limit on the number of states
Doklady Akademii Nauk, Tome 190 (1970) no. 5, pp. 1048-1051.

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

@article{DAN_1970_190_5_a9,
     author = {J. M. Barzdi\c{n}\v{s}},
     title = {Deciphering of sequential networks in the absence of an upper limit on the number of states},
     journal = {Doklady Akademii Nauk},
     pages = {1048--1051},
     publisher = {mathdoc},
     volume = {190},
     number = {5},
     year = {1970},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1970_190_5_a9/}
}
TY  - JOUR
AU  - J. M. Barzdiņš
TI  - Deciphering of sequential networks in the absence of an upper limit on the number of states
JO  - Doklady Akademii Nauk
PY  - 1970
SP  - 1048
EP  - 1051
VL  - 190
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1970_190_5_a9/
LA  - ru
ID  - DAN_1970_190_5_a9
ER  - 
%0 Journal Article
%A J. M. Barzdiņš
%T Deciphering of sequential networks in the absence of an upper limit on the number of states
%J Doklady Akademii Nauk
%D 1970
%P 1048-1051
%V 190
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1970_190_5_a9/
%G ru
%F DAN_1970_190_5_a9
J. M. Barzdiņš. Deciphering of sequential networks in the absence of an upper limit on the number of states. Doklady Akademii Nauk, Tome 190 (1970) no. 5, pp. 1048-1051. http://geodesic.mathdoc.fr/item/DAN_1970_190_5_a9/