I. K. Rystsov

发表

Polynomial Complete Problems in Automata Theory

I. K. Rystsov, I. Rystsov, 1983, Inf. Process. Lett..

Quasioptimal Bound for the Length of Reset Words for Regular Automata

I. K. Rystsov, 1995, Acta Cybern..

Reset Words for Commutative and Solvable Automata

I. K. Rystsov, I. Rystsov, 1997, Theor. Comput. Sci..

The Parallel Complexity of Some Arithemic and Algebraic Operations

I. K. Rystsov, 1987, FCT.

Parallel complexity of algebraic operations

I. K. Rystsov, 1988 .

Primitive and Irreducible Automata

I. K. Rystsov, I. Rystsov, 2015 .

Estimation of the length of reset words for automata with simple idempotents

I. K. Rystsov, I. Rystsov, 2000 .

Almost optimal bound of recurrent word length for regular automata

I. K. Rystsov, I. Rystsov, 1995 .

Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton

I. K. Rystsov, 1976, Cybernetics.

Asymptotic estimate of the length of a diagnostic word for a finite automaton

I. K. Rystsov, 1980 .

Rank of a finite automaton

I. K. Rystsov, I. Rystsov, 1992 .

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

I. K. Rystsov, M. A. Spivak, A. A. Klyachko, 1987 .