Skip to main content
SpringerLink
Log in
SpringerLink
Log in

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

  • Book
  • © 1969

Overview

Editors:
  1. Vladimir Georgievich Lazarev

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. A. V. Zakrevskii

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 chapters)

  1. Front Matter

    Pages i-x
    Download chapter 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
    Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • 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

Bibliographic Information

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

  • Editors: Vladimir Georgievich Lazarev, A. V. Zakrevskii

  • DOI: https://doi.org/10.1007/978-1-4684-9033-6

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Consultants Bureau, New York 1969

  • Softcover ISBN: 978-1-4684-9035-0Published: 07 May 2012

  • eBook ISBN: 978-1-4684-9033-6Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: X, 172

  • Topics: Science, Humanities and Social Sciences, multidisciplinary

Publish with us

Policies and ethics

Back to top

Search

Navigation