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

Buch | Softcover

172 Seiten

2012
Springer-Verlag New York Inc.
978-1-4684-9035-0 (ISBN)

Artikel merken

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.

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.

Zusatzinfo	X, 172 p.
Verlagsort	New York, NY
Sprache	englisch
Maße	210 x 279 mm
Themenwelt	Schulbuch / Wörterbuch
	Geisteswissenschaften
	Naturwissenschaften
	Sozialwissenschaften
	Technik ► Elektrotechnik / Energietechnik
ISBN-10	1-4684-9035-4 / 1468490354
ISBN-13	978-1-4684-9035-0 / 9781468490350
Zustand	Neuware