Turing machines with three states and two symbols, and with one state and n symbols Yu. A. Kryukov OriginalPaper Pages: 15 - 16
Comparison of discrete converters in terms of absolute speed of response in a certain equivalence class Yu. G. Shukuryan OriginalPaper Pages: 17 - 21
The problem of completeness in the structural theory of probabilistic automata L. V. Makarevich OriginalPaper Pages: 22 - 26
On a certain method of obtaining the lower complexity bounds of contact networks, and on the complexity of implementation of functions “having a small number of ones” by means of contact networks T. V. Danilova-Danil'yan OriginalPaper Pages: 27 - 36
Aspects of the theory of local algorithms on graphs I. V. Khutoryanskaya OriginalPaper Pages: 37 - 44
Estimates of functions characterizing turing machine operation V. A. Moshchenskii OriginalPaper Pages: 45 - 53
On complexity of representing permutations of symmetric semigroups in terms of the elements of the system of generators Yu. V. Golunkov BriefCommunication Pages: 56 - 58
Attained evaluations of the length of a Kohavi-Lavalle control experiment I. S. Grunskii BriefCommunication Pages: 59 - 61
Optimal placement of information on magnetic tape with prior positioning of the tape S. S. VeniaminovG. A. Sokolov OriginalPaper Pages: 67 - 77
Potential efficiency of discrete accumulators of pulses G. K. VlasovaP. S. DavidenkoV. Yu. Lapii OriginalPaper Pages: 78 - 81
Optimal code-redundancy methods for error correction in finite automata Yu. G. KarpovM. G. Karpovskii OriginalPaper Pages: 82 - 88
A method of describing information flows in an “object-machine” system M. M. GrudininV. M. Egipko OriginalPaper Pages: 101 - 109
The finiteness of methods of solving a problem in quadratic programming V. N. Gordeev OriginalPaper Pages: 110 - 114
Scheduling theory. Problems and methods of solution. I. V. Ya. BurdyukV. V. Shkurba OriginalPaper Pages: 115 - 135
An extension of the class of penalty functions in scheduling problems A. D. Glubochanskii BriefCommunication Pages: 136 - 138
Asymptotic behavior of solutions to the Johnson problem V. M. Portugal OriginalPaper Pages: 139 - 142
Operational reliability analysis of an aggregate of complex systems V. E. DikarevN. A. Shishonok OriginalPaper Pages: 143 - 152
Multistage quantitative games with unprescribed time A. BlaquièreG. Leitmann OriginalPaper Pages: 164 - 172
The solution of the transportation problem with fixed liabilities P. P. Ignatenko BriefCommunication Pages: 195 - 197
On the attainable upper bound of the length of the minimal adjustment experiment for a Moore automaton A. M. BogomolovI. S. Grunskii BriefCommunication Pages: 198 - 199
On the determination of the upper bound for the knapsack problem with additional constraints B. G. LitvakA. V. Naivel't OriginalPaper Pages: 200 - 203
Linguistic bases for automation of information search G. É. VlédutsR. S. Gilyarevskii Book Reviews Pages: 204 - 205