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 th...
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
1969, 1969
|
| Edition: | 1st ed. 1969 |
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Approximate Methods of Solving Logical Problems
- Certain Questions in the Coding of Finite Automata
- Some Methods of Increasing the Reliability of Finite Automata
- Some Algorithms for Synthesizing Schemes of Minimal Depth
- Construction of Minimal Disjunctive Normal Forms
- One Method of Synthesizing Normal Forms
- Optimization of the Search for a Shortest Covering
- Minimizing the Number of Arguments of Boolean Functions
- Experimental Evaluation of One Method of Minimizing the Number of States of Discrete Automata
- Economizing of Memory Utilization
- Algorithm for Minimizing Operational Memory
- Synthesis of Optimal Algorithms for Recognizing Boolean Functions
- Economizing Program Memory of Special-Purpose Digital Computers
- Synthesizing a Stochastic Automaton
- Constructing Tests for Finite Automata by Means of the Language of Regular Expressions
- APPENDIX. Description of the LYaPAS Language
- A. D. Zakrevskii