|
|
Publications in Math-Net.Ru
-
Моделирование вычислительной структуры, реализующей конечный детерминированный автомат
Issled. Inform., 11 (2007), 75–78
-
Polynomial models of the final determined automatic devices above a field $GF(2^p)$.
Vestn. Udmurtsk. Univ. Mat., 2007, no. 1, 83–98
-
Redundancy reduction in modeling a mapping that realizes a finite deterministic automaton
Issled. Inform., 9 (2005), 81–86
-
Modeling Markov chains in Galois fields
Diskr. Mat., 16:2 (2004), 136–147
-
Полиномиальные структурные модели генераторов цепей Маркова в базисе ПЛИС класса FPGA
Issled. Inform., 6 (2003), 81–94
-
Polynomial representation of automaton models of Markov functions over a Galois field
Issled. Inform., 5 (2003), 45–56
-
Minimization of the number of elements of a homogeneous computational structure
Issled. Inform., 2 (2000), 117–124
-
Synthesis of autonomous probabilistic automata based on Galois fields
Issled. Inform., 2 (2000), 107–116
-
Adjustable circuits in built-in testing systems
Avtomat. i Telemekh., 1995, no. 3, 179–183
-
Homogeneous computing structures over a finite field
Issled. Prikl. Mat., 17 (1990), 105–114
-
Fault-tolerance of a network automaton model
Issled. Prikl. Mat., 16 (1989), 138–145
-
Application of theory of linear sequential machines to diagnosing systems
Avtomat. i Telemekh., 1988, no. 8, 3–27
-
Conversational tools in the on-line management system of the teaching process DELTA-U
Issled. Prikl. Mat., 9 (1981), 116–118
-
Basic parameters of the data bank in the DELTA-U system
Issled. Prikl. Mat., 9 (1981), 112–115
-
An interactive system for on-line management of the teaching process (Delta-U)
Issled. Prikl. Mat., 8 (1980), 115–117
© , 2026