Abstract is missing.
- Possibilities of Probabilistic on-line Counting MachinesFarid M. Ablayev. 1-4
- Functional Systems on SemilatticesGennady P. Agibalov. 5-9
- Recognition of Properties in K-Valued Logic and Approximate AlgorithmsValery B. Alekseyev. 10-13
- Linearized Disjunctive Normal Forms of Boolean FunctionsA. A. Alexanyan. 14-16
- On a Stable Generating of Random Sequences by Probabilistic AutomataJu. A. Al pin, B. S. Kotchkarev, R. G. Mubarakzianov. 17-20
- Automata Classes Induced by Post ClassesS. V. Alyoshin. 21-23
- Effective Lower Bounds for Complexity of Some Classes of SchemesAlexander E. Andreev. 24-29
- Stable Finite Automata Mappings and Church-Rosser SystemsA. V. Anisimov, Vladimir A. Oleshchuk. 30-33
- The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable SetsMarat M. Arslanov. 34-37
- Duality of Functions and Data in Algorithms DescriptionA. D. Astakhov. 38-40
- On Direct Methods of Realization of Normal Algorithms by Turing MachinesG. V. Babikov. 41
- Verbal Operation on AutomatonD. N. Babin. 42-44
- The New Way of Probabilistic Compact TestingA. S. Barashko. 45-47
- Computational Problems in Alphabetic Coding TheoryM. Yu. Baryshev, L. P. Zhil tzova, A. A. Markov. 48-50
- On the Synthesis of Irredundant Automata from a Finite Set of ExperimentsS. A. Bogomolov. 51-52
- On the Equivalence Problem of States for Cellular AutomataA. A. Bolotov. 53-54
- Arsenals and Lower BoundsLothar Budach. 55-64
- Chain-like Model of Programs CommunicationR. G. Bukharajev, A. I. Enikeev, I. I. Makarov. 65-67
- Structur AutomataR. G. Bukharajev, I. R. Nasirov. 68-73
- On A-Completeness for some Classes of Bounded Determitate FunctionsB. A. Buyevich. 74-77
- Structure Synthesis of Parallel Programs (Methodology and Tools)G. E. Cejtlin, E. L. Jushchenko. 78-81
- Saturating Flows in NetworksBogdan S. Chlebus, Marek Chrobak, Krzysztof Diks. 82-91
- On the Number of DNF Minimal Relatively Arbitrary Measures of ComplexityI. P. Cuhrov. 92-94
- Soliton AutomataJürgen Dassow, Helmut Jürgensen. 95-102
- On Development of Dialogue Concurrent SystemsA. I. Enikeev. 103-108
- Discrete Analogue of the Neumann Method is not OptimalS. M. Ermakov, B. B. Pokhodzey. 109-112
- A Simplest Probability Model of Asynchronous IterationsS. M. Ermakov, A. S. Rasulov. 113-115
- Semantic Foundations of ProgrammingYuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko. 116-122
- Conditions for Existence of Nontrivial Parallel Decompositions of Sequential MachinesN. V. Evtushenko. 123-126
- On the Digital System Diagnostics under UncertaintyA. B. Frolov. 127-131
- The Implicating Vector Problem and its Applications to Probabilistic and Linear AutomataN. Z. Gabbasov. 132-136
- Some Asymptotic Evalutions of Complexity of Information SearchingE. E. Gasanov. 137-139
- On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous BasesS. B. Gashkov. 140-144
- On the Capabilities of Alternating and Nondeterministic Multitape AutomataDainis Geidmanis. 150-154
- Codes, Connected With a Fraction Linear Functions Group and Their DecodingIgor Gashkov, V. M. Sidelnikov. 150-149
- Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured GraphsAlan Gibbons, Wojciech Rytter. 155-162
- On the Complexity of Elementary Periodical Functions Realized by Switching CircuitesM. I. Grinchuk. 163-166
- Efficient Algorithmic Construction of DesignsHans-Dietrich O. F. Gronau. 167-171
- On the Complexity of Lie AlgebrasHans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt. 172-179
- A Characterization of Sequential Machines by Means of Their Behaviour FragmentsI. S. Grunsky. 180-184
- Some Observations of NP Complete SetsJuris Hartmanis. 185-196
- Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract)Armin Hemmerling. 197-203
- Efficient Implementation of Structural RecursionKlaus Indermark, Herbert Klaeren. 204-213
- Minimal Numberings of the Vertices of Trees - Approximate ApproachM. A. Iordanskii. 214-217
- Dyck::1::-Reductions of Context-free LanguagesMatthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen. 218-227
- Information Flow and Width of Branching Programs (Extended Abstract)Stasys Jukna. 228-230
- On Some Operations of Partial Monotone Boolean Function SimplifyingL. M. Karahanjan, Alexander A. Sapozhenko. 231-233
- On Complexity of Computations with Limited MemoryN. A. Karpova. 234-235
- On the Problem of Completeness for the Regular MappingsK. V. Kolyada. 236-237
- The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite SetA. D. Korshunov. 239-243
- A Chriterion of Polynominal Lower Bounds of Combinational ComplexityNikolai K. Kossovsky. 244-245
- On Generalized Process LogicVadim E. Kotov, Ludmila Cherkasova. 246-250
- Verification of Programs with Higher-Order ArraysWojciech Kowalczyk, Pawel Urzyczyn. 251-258
- On the Complexity of Analyzing Experiments for Checking local Faults of an AutomatonV. A. Kozlovskiy. 259-262
- Exponential Lower Bounds for Real-Time Branching ProgramsKlaus Kriegel, Stephan Waack. 263-267
- On the Conditions of Supplementicity in Functional SystemsV. B. Kudrjavitzev. 268-271
- On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean VariablesNikolai N. Kuzjurin. 272
- The Problem of Minimal Implicating VectorS. E. Kuznetsov, N. N. Nurmeev, F. I. Salimov. 273-278
- Built-in Self-testing of Logic Circuits Using Imperfect DuplicationR. Kh. Latypov. 279-283
- Algebras with Approximation and Excursive Data StructuresAlexander A. Letichevsky. 284-287
- Procedural Implementation of Algebraic Specifications of Abstract Data TypesIrina A. Lomazova. 288-292
- On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact CircuitsSergej A. Lozkin, M. A. Koshkin. 293-296
- On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean FunctionsSergej A. Lozkin, A. A. Semenov. 297-300
- Diophantine ComplexityYu. Matijasevich. 301
- The Power of Nondeterminism in Polynominal-size Bounded-width Branching ProgramsChristoph Meinel. 302-309
- Estimation Algorithms of Infinite Graphs Percolation ThresholdM. V. Men shikov, S. A. Zuev. 310-313
- A Solving of Problems on Technological ModelsV. J. Mikhailov. 314-317
- Some Formal Systems of the Logic ProgrammingGrigori Mints. 318-322
- On the Programs with Finite DevelopmentMikhail Ju. Moshkov. 323-327
- D-Representing Code Problem SolutionG. L. Movsisian, Zh. G. Margarian. 328-331
- Metric Properties of Random SequenceR. G. Mubarakzianov. 332-333
- Adaptive Strategies for Partially Observable Controlled Ranom SeriesV. I. Mukhin. 334-338
- The Degrees of Nondeterminism in Pushdown AutomataIldar R. Nasyrov. 339-342
- Statistically Effective Algorithms for Automata ControlV. N. Noskov. 343-346
- Linear Test Procedures of RecognitionV. I. Pereyaslavsky. 347-348
- Evaluatiobn of Cardinalities of Some Families of -Classes in P::roh0::I. G. Perfilyeva. 349-353
- On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous AutomataA. S. Podkolzin. 354-358
- On Approximate Solution of the Problem of Equivalent Transformations of ProgramsR. I. Podlovcenko. 359-363
- Ranomized Parallel ComputationSanguthevar Rajasekaran, John H. Reif. 364-376
- On Checking Correctness of Some Classes of Control SystemsN. P. Redkin. 377-382
- The Parallel Complexity of Some Arithemic and Algebraic OperationsI. K. Rystsov. 383-385
- On Difficulties of Solving a Problem of Decomposition of the System of Boolean EquationsA. A. Safarian. 386-388
- The Number of Fuzzy Monotone FunctionsAlexander A. Sapozhenko. 389-390
- Bounded Set Theory and Polynominal ComputabilityVladimir Yu. Sazonov. 391-395
- Index-Sets of Factor-Objects of the Post NumberingVictor L. Selivanov. 396-400
- On Realization of Boolean Functions by Schemes Consisting of Checked ElementsN. A. Shkalikova. 401-405
- The Complexity of the Sequential Choice MechanismL. A. Sholomov. 406-408
- Nondeterministic Finite Algorithmic Procedures as the Models of Abstract ComputabilityV. D. Soloviev. 409-411
- The Reducibility of Random Sequences by AutomataV. R. Solovieva. 412-413
- On Structure Complexity of Normal Basis of Finite FieldS. A. Stepanov, Igor Shparlinski. 414-416
- On Comparison of Boolean BasesVladimir Stetsenko. 417-419
- A Tradeoff Between Pagenumber and Width of Book Embedding of GraphsElena Stöhr. 420-423
- On Metric Properties of Automata and Epsilon-Approximation of Automaton MappingA. S. Strogalov. 424-427
- Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical EquationE. A. Sumenkov. 428-431
- Synthesis of Universal Finite AutomatsA. A. Sytnik. 432-434
- On Cartesian Powers of P::2::V. A. Taimanov. 435
- Complexity Gaps of Turing Machines of Infinite WordsDaina Taimina. 436-439
- Distributed Infimum ApproximationGerard Tel. 440-447
- On the Number of Keys in Relational DatabasesBernhard Thalheim. 448-455
- Complexity and Depth of Formulas Realizing Functions From Closed ClassesA. B. Ugol nikov. 456-461
- Reliable Networks from Unreliable Gates With Almost Minimal ComplexityDietmar Uhlig. 462-469
- On the Standard and Pseudostandard Star Height of Regular SetsP. I. Validov. 470-471
- To Automation of Theorem SythesisS. N. Vassiljev. 472-476
- On Efficiency of Prefix Word-Encoding of Binary MessagesE. G. Vorobyova. 477-478
- Deductive Program Synthesis and Markov s PrincipleAndrei Voronkov. 479-482
- Complexity of the Problem of Approximation of Stochastic Matrix by Rational ElementsV. M. Zacharov, S. E. Kuznetsov. 483-487
- To the Functional Equivalence of Turing MachinesVladimir A. Zakharov. 488-491
- Theorem Proving in Intermediate and Modal LogicsMichael Zakharyaschev. 492-496
- The Analysis of Concurrent Logic Control AlgorithmsArkadij Zakrevskij. 497-500
- On a Connection Between the Resolution Method and the Inverse MethodN. K. Zamov. 501-505