Gabbasov Nil Zamilovich

Publications in Math-Net.Ru

1. Realization of discrete probabilistic processes by finite linear and probabilistic automata
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 11,  3–6
2. On the algorithmic recognition of the codability property of infinite languages
   
   Issled. Prikl. Mat., 20 (1992),  13–17
3. Some results on “structor automata”
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1990, no. 1,  3–9
4. Representation of linear automata by a finite weighted tree
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7,  68–70
5. The problem of extension with the smallest possible rank of a partial matrix and its application to the theory of linear automata
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 2,  16–19
6. Solvability of the problem of singular extension of partial matrices
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1983, no. 12,  8–12
7. An extension of generalized Hankel matrices
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 5,  35–39
8. A remark on the problem locating the eigenvalues of real matrices
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 11,  98–100
9. The estimation of the domains of nonnegativity of the Cauchy function and its derivatives up to order $n-1$ for an $n$th order ordinary linear differential equation
   
   Differ. Uravn., 6:7 (1970),  1308–1310
10. On the characterization of events that are representable by finite probability automata
    
    Uchenye Zapiski Kazanskogo Universiteta, 130:3 (1970),  18–27
11. A certain integral formula for the solution of ordinary differential equations
    
    Differ. Uravn., 5:9 (1969),  1652–1662