| Reset words for commutative and solvable automata I Rystsov Theoretical Computer Science 172 (1-2), 273-279, 1997 | 115 | 1997 |
| Estimation of the length of reset words for automata with simple idempotents IK Rystsov Cybernetics and Systems Analysis 36, 339-344, 2000 | 55 | 2000 |
| Polynomial complete problems in automata theory IK Rystsov Information Processing Letters 16 (3), 147-151, 1983 | 50 | 1983 |
| Quasioptimal bound for the length of reset words for regular automata IK Rystsov Acta Cybernetica 12 (2), 145-152, 1995 | 48 | 1995 |
| In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton AA Klyachko, IK Rystsov, MA Spivak Cybernetics 23 (2), 165-171, 1987 | 40 | 1987 |
| Rank of a finite automaton IK Rystsov Cybernetics and Systems Analysis 28 (3), 323-328, 1992 | 34 | 1992 |
| Almost optimal bound of recurrent word length for regular automata IK Rystsov Cybernetics and Systems Analysis 31 (5), 669-674, 1995 | 22 | 1995 |
| An extremely combinatorial problem connected with the bound on the length of a recurrent word in an automata AA Kljachko, IK Rystsov, MA Spivak Kybernetika 2, 16-25, 1987 | 21 | 1987 |
| Exact linear bound for the length of reset words in commutative automata I Rystsov Publ. Math. Debrecen 48, 3-4, 1996 | 19 | 1996 |
| On minimizing the length of synchronizing words for finite automata IK Rystsov Theory of Designing of Computing Systems, 75-82, 1980 | 18 | 1980 |
| Asymptotic estimate of the length of a diagnostic word for a finite automaton IK Rystsov Cybernetics 16 (2), 194-198, 1980 | 17 | 1980 |
| Computational aspects of a method of stochastic approximation KV Runovski, I Rystsov, HJ Schmeisser Zeitschrift für Analysis und ihre Anwendungen 25 (3), 367-383, 2006 | 10 | 2006 |
| Primitive and irreducible automata IK Rystsov Cybernetics and Systems Analysis 51, 506-513, 2015 | 6 | 2015 |
| On an extremal combinatorial problem connected with an estimate for the length of a reflexive word in an automaton AA Klyachko, IC Rystsov, MA Spivak Kibernetika (Kiev) 2, 16-20, 1987 | 6 | 1987 |
| Representations of regular ideals in finite automata IK Rystsov Cybernetics and Systems Analysis 39, 668-675, 2003 | 5 | 2003 |
| Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton IK Rystsov Cybernetics 12 (3), 354-356, 1976 | 5 | 1976 |
| Affine automata and classical fractals IK Rystsov Cybernetics and Systems Analysis 54, 11-20, 2018 | 4 | 2018 |
| Primitive automata that are synchronizing I Rystsov, M Szykuła arXiv preprint arXiv:2307.01302, 2023 | 3 | 2023 |
| Cerny’s conjecture for automata with simple idempotents IK Rystsov Cybernetics and Systems Analysis 58 (1), 1-7, 2022 | 3 | 2022 |
| Weak equivalence of automata IK Rystsov Cybernetics 26 (5), 737-742, 1990 | 3 | 1990 |
