Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов

1. Front Matter

   Pages i-x

   PDF

2. Approximate Methods of Solving Logical Problems

   • A. D. Zakrevskii

   Pages 1-9

3. Certain Questions in the Coding of Finite Automata

   • E. I. Piil’

   Pages 10-22

4. Some Methods of Increasing the Reliability of Finite Automata

   • E. N. Turuta

   Pages 23-40

5. Some Algorithms for Synthesizing Schemes of Minimal Depth

   • Ya. I. Fet

   Pages 41-46

6. Construction of Minimal Disjunctive Normal Forms

   • N. A. Gorbovitskaya, I. Sh. Pinsker

   Pages 47-64

7. One Method of Synthesing Normal Forms

   • A. M. Kukinov

   Pages 65-75

8. Optimization of the Search for a Shortest Covering

   • A. D. Zakrevskii, V. I. Ostrovskii

   Pages 76-86

9. Minimizing the Number of Arguments of Boolean Functions

   • G. P. Agibalov

   Pages 87-91

10. Experimental Evaluation of One Method of Minimizing the Number of States of Discrete Automata

    • Yu. V. Pottosin

    Pages 92-98

11. Economizing of Memory Utilization

    • S. V. Bykova

    Pages 99-102

12. Algorithm for Minimizing Operational Memory

    • N. V. Bukhgol’ts, V. F. D’yachenko, V. G. Lazarev, K. K. Chernyshev, V. A. Sharov

    Pages 103-109

13. Synthesis of Optimal Algorithms for Recognizing Boolean Functions

    • N. R. Toropov

    Pages 110-116

14. Economizing Program Memory of Special-Purpose Digital Computers

    • K. K. Chernyshev

    Pages 117-124

15. Synthesizing a Stochastic Automation

    • V. M. Chentsov

    Pages 125-134

16. Language of Regular Expressions

    • V. I. Kaznacheev

    Pages 135-140

17. Back Matter

    Pages 141-172

    PDF

The present collection is devoted to algorithmic methods, and computer algorithms, for the synthesis of digital computers and controlling machines. The work reported in the papers collected here was performed at the Institute for Prob­ lems of Information Transmission of the Academy of Science of the USSR, in the section for computational techniques of the Institute of Mathematics of the Siberian Division of the Academy of Science of the USSR, and in the Problem Laboratory of Computing Devices of the Siberian Physics -Engineering Ins titute. The paper by A. D. Zakrevskii is devoted to the discussion of ways of solving basic prob­ lems in the area of computer solution of logical problems, including the problem of automata synthesis. In the paper by E. I. Piil' a methodology is presented for coding internal states and input states of finite automata which is suitable for computer realization. The suggested coding al­ gorithms permit one to take account simultaneously of constraints on inadmissible critical races of memory elements, speed and simplicity of structure of the automaton's logical transformer. E. N. Turuta's paper investigates certain methods of synthesizing reliable automata, based on the introduction of redundancy into the automaton's memory block. The paper by Ya. I. Fet contains a solution to the problem of synthesizing schemes of minimal depth for one of the most widely used bases of elements in computer technology.

• Area
• Boolean function
• Division
• Finite
• algorithms
• automata
• computer
• constraint
• finite automata
• information
• mathematics
• memory
• optimization
• regular expression
• technology

• Laboratory of Automatic Control Devices, Institute for Problems of Information Transmission, Academy of Sciences of the USSR, Moscow, USSR

  Vladimir Georgievich Lazarev, A. V. Zakrevskii

Policies and ethics