Geodesic
The problem of extension with the smallest possible rank of a partial matrix and its application to the theory of linear automata
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 2 (1984), pp. 16-19 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1984_2_a2,
     author = {N. Z. Gabbasov},
     title = {The problem of extension with the smallest possible rank of a~partial matrix and its application to the theory of linear automata},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {16--19},
     year = {1984},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1984_2_a2/}
}
TY  - JOUR
AU  - N. Z. Gabbasov
TI  - The problem of extension with the smallest possible rank of a partial matrix and its application to the theory of linear automata
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1984
SP  - 16
EP  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/IVM_1984_2_a2/
LA  - ru
ID  - IVM_1984_2_a2
ER  - 
%0 Journal Article
%A N. Z. Gabbasov
%T The problem of extension with the smallest possible rank of a partial matrix and its application to the theory of linear automata
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1984
%P 16-19
%N 2
%U http://geodesic.mathdoc.fr/item/IVM_1984_2_a2/
%G ru
%F IVM_1984_2_a2
N. Z. Gabbasov. The problem of extension with the smallest possible rank of a partial matrix and its application to the theory of linear automata. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 2 (1984), pp. 16-19. http://geodesic.mathdoc.fr/item/IVM_1984_2_a2/