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

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. 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 Front Matter....Pages i-x Approximate Methods of Solving Logical Problems....Pages 1-9 Certain Questions in the Coding of Finite Automata....Pages 10-22 Some Methods of Increasing the Reliability of Finite Automata....Pages 23-40 Some Algorithms for Synthesizing Schemes of Minimal Depth....Pages 41-46 Construction of Minimal Disjunctive Normal Forms....Pages 47-64 One Method of Synthesing Normal Forms....Pages 65-75 Optimization of the Search for a Shortest Covering....Pages 76-86 Minimizing the Number of Arguments of Boolean Functions....Pages 87-91 Experimental Evaluation of One Method of Minimizing the Number of States of Discrete Automata....Pages 92-98 Economizing of Memory Utilization....Pages 99-102 Algorithm for Minimizing Operational Memory....Pages 103-109 Synthesis of Optimal Algorithms for Recognizing Boolean Functions....Pages 110-116 Economizing Program Memory of Special-Purpose Digital Computers....Pages 117-124 Synthesizing a Stochastic Automation....Pages 125-134 Language of Regular Expressions....Pages 135-140 Back Matter....Pages 141-172