1. Algorithm provision of the program package VEKTOR-1 intended for solving one class of electronic computer design problems

   • V. M. Glushkov
   • Yu. V. Kapitonova
   • I. V. Sergienko

   OriginalPaper Pages: 485 - 489

2. Decomposition of asynchronous logical schemes. II

   • A. N. Chebotarev

   OriginalPaper Pages: 489 - 493

3. Problem of identity transformations of schemes of structured programs with closed logical conditions. II

   • G. E. Tseitlin

   OriginalPaper Pages: 493 - 502

4. Post algebras of type F ₄ ^∞

   • B. A. Romov

   OriginalPaper Pages: 502 - 506

5. Commutative closure of context-free languages

   • L. P. Lisovik

   OriginalPaper Pages: 506 - 513

6. Recognition of formal languages in one-dimensional iterative automata

   • G. S. Plesnevich

   OriginalPaper Pages: 513 - 520

7. Finite-automata mappings in a partially commutative semigroup

   • V. V. Zubenko

   OriginalPaper Pages: 521 - 526

8. A mechanical propositional calculus using Smullyan's analytic tables

   • G. L. Mogilevskii
   • D. A. Ostroukhov

   OriginalPaper Pages: 526 - 529

9. Testing of combinational circuits designed from multivalued logic elements

   • V. V. Brovarnik

   OriginalPaper Pages: 530 - 539

10. Processing of list structures in the KODIAL/US system

    • I. A. Perekhod
    • S. F. Tolkachev

    OriginalPaper Pages: 539 - 546

11. Determination of parameters of functional modules of integrating computational structures

    • V. F. Guzik

    OriginalPaper Pages: 547 - 550

12. Investigation of one elementary problem of pursuit on a grid

    • N. Z. Shor
    • I. M. Asel'derova

    OriginalPaper Pages: 550 - 555

13. A differential evasion game

    • P. B. Gusyatnikov

    OriginalPaper Pages: 556 - 562

14. Exponential growth of coefficients of aggregating equations

    • S. I. Veselov
    • V. N. Shevchenko

    OriginalPaper Pages: 563 - 565

15. Certain classes of traveling-salesman problems

    • V. S. Aizenshtat
    • E. P. Maksimovich

    OriginalPaper Pages: 565 - 569

16. Transportation problem based on time criterion with additional constraints

    • Nguyen Van Vy

    OriginalPaper Pages: 569 - 575

17. Nonstationary stochastic programming problems

    • A. A. Gaivoronskii

    OriginalPaper Pages: 575 - 579

18. Conditions of equivalence of multistep and one-step optimization for controlled plants with memory

    • N. V. Andreev
    • E. I. Shor

    OriginalPaper Pages: 579 - 585

19. A scheme of the method of sequential analysis and sifting of variants

    • V. L. Volkovich
    • A. F. Voloshin

    OriginalPaper Pages: 585 - 593

20. A nonlinear escape problem

    • V. V. Ostapenko

    OriginalPaper Pages: 594 - 601

21. Estimation of certain functionals characterizing reliability

    • L. S. Stoikova

    OriginalPaper Pages: 602 - 609

22. Regular sets and finite automata overβ-groups

    • L. B. Smikun

    OriginalPaper Pages: 609 - 615

23. Minimax plans of regression experiments taking into account systematic errors

    • E. V. Sedunov
    • N. A. Pecherskaya

    OriginalPaper Pages: 615 - 620

24. Sufficient conditions of completeness of linear closures of recognition algorithms

    • Bak Ryng Khang

    OriginalPaper Pages: 620 - 628

25. A stochastic single-product problem of planning stocks with limited and unlimited periods of use

    • F. Mirzoakhmedov

    Brief Communications Pages: 629 - 632

26. Properties of functions satisfying a local Lipschitz condition

    • A. M. Gupal

    Brief Communications Pages: 632 - 634

27. Methods of proving the correctness of programs in ANALITIK

    • V. S. Kostyrko

    Brief Communications Pages: 635 - 637

28. Specification of the structure of data in TISS-2

    • A. P. Lodysev

    Brief Communications Pages: 638 - 641

29. Minimization of composite regression functions

    • B. T. Polyak

    Brief Communications Pages: 642 - 644

30. An approach to determining the minimum cut-set of a graph

    • A. I. Krapiva

    Brief Communications Pages: 645 - 647