RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Shalyto Anatoly Abramovich

Statistics Math-Net.Ru
Total publications: 17
Scientific articles: 17
Cited articles: 8
Citations in Math-Net.Ru: 23

Number of views:
This page:496
Abstract pages:2163
Full texts:767
References:110
Professor
Doctor of technical sciences (1999)
Speciality: 05.13.11 (Mathematical and programme software for computers, computer systems, and networks)
Birth date: 28.05.1948
Phone: +7 (812) 292 95 45
E-mail:
Website: http://server1.hostograd.ru/person/94/94.htm
Keywords: finite state mashins, automata-based-programming.
UDC: 621.391.1-503.5, 681.3.06:62-507, 519.714, 681.3.06, 62-507
MSC: 94C10

Subject:

Finite state mashins, automata-based-programming.


http://www.mathnet.ru/eng/person42839
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
1. Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
D. S. Chivilikhin, V. I. Ulyantsev, A. A. Shalyto
Avtomat. i Telemekh., 2016, no. 3,  137–151
2. Combining de Bruijn graphs, overlap graphs and microassembly for de novo genome assembly
A. A. Sergushichev, A. V. Alexandrov, S. V. Kazakov, F. N. Tsarev, A. A. Shalyto
Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 13:2(2) (2013),  51–57
3. Application of genetic programming and model checking for finite-state machine induction
K. V. Egorov, F. N. Tsarev, A. A. Shalyto
Tr. SPIIRAN, 15 (2010),  123–135
4. Translation of discrete finite automata descriptions from Microsoft Visio format to source code in C language
L. V. Stolyarov, I. R. Dedinskii, A. A. Shalyto
Prikl. Diskr. Mat., 2009, no. supplement № 1,  81–83
5. Automata-based approach for correct Java Card-program
A. A. Klebanov, A. A. Shalyto
Model. Anal. Inform. Sist., 15:3 (2008),  47–55
6. Logic Control and “Reactive” Systems: Algorithmization and Programming
A. A. Shalyto
Avtomat. i Telemekh., 2001, no. 1,  3–39
7. Linearized graph algorithms for Boolean formulas: independent-fragment design method
B. P. Kuznetsov, A. A. Shalyto
Avtomat. i Telemekh., 1998, no. 9,  142–154
8. Implementation of Systems of Boolean Functions by Linear Arithmetic Polynomials with Masking
V. N. Kondrat'yev, A. A. Shalyto
Avtomat. i Telemekh., 1997, no. 3,  200–215
9. The Use Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I
A. A. Shalyto
Avtomat. i Telemekh., 1996, no. 7,  144–169
10. The Use of Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I
A. A. Shalyto
Avtomat. i Telemekh., 1996, no. 6,  148–158
11. Implementation of Boolean Functions by One Linear Arithmetic Polynomial with Masking
V. N. Kondratyev, A. A. Shalyto
Avtomat. i Telemekh., 1996, no. 1,  158–170
12. Realization of systems of Boolean functions by linear arithmetic polynomials
V. N. Kondrat'ev, A. A. Shalyto
Avtomat. i Telemekh., 1993, no. 3,  135–151
13. Representation of Boolean functions as arithmetical polinomials
V. L. Artyukhov, V. N. Kondrat'ev, A. A. Shalyto
Avtomat. i Telemekh., 1988, no. 4,  138–147
14. Binary Programs and Their Realization by Asynchronous Automata
Yu. L. Sagalovich, A. A. Shalyto
Probl. Peredachi Inf., 23:1 (1987),  89–96
15. A set of transformations of certain forms of representation of Boolean functions
B. P. Kuznetsov, A. A. Shalyto
Avtomat. i Telemekh., 1985, no. 11,  120–127
16. Adjustible binary procedures and cyclic programs
V. L. Artyukhov, B. P. Kuznetsov, A. A. Shalyto
Avtomat. i Telemekh., 1984, no. 11,  112–119
17. On estimating the implementation complexity of boolean formulae in terms of tree-like structures of adjustible modules
V. L. Artyukhov, G. A. Kopeikin, A. A. Shalyto
Avtomat. i Telemekh., 1981, no. 11,  124–130

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017