Synthesis of digital automata [electronic resource] / Edited by V.G. Lazarev and A.D. Zakrevskii. Translated from Russian by Edwin S. Spiegelthal.

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 t...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via Springer)
Other Authors: Lazarev, V. G. (Vladimir Georgievich), 1925- (Editor), Zakrevskiĭ, A. D. (Editor)
Other title:Problemy sinteza t︠s︡ifrovykh avtomatov. English.
Format: Electronic eBook
Language:English
Russian
Published: New York : Consultants Bureau, 1969.
Subjects:

MARC

LEADER 00000cam a2200000x 4500
001 b7982385
006 m o d
007 cr |||||||||||
008 100323s1969 nyua o 000 0 eng d
005 20240418143348.4
019 |a 300764090  |a 861706722  |a 1001504800  |a 1038412120  |a 1039533761  |a 1046617517 
020 |a 9781468490336  |q (electronic bk.) 
020 |a 1468490338  |q (electronic bk.) 
024 7 |a 10.1007/978-1-4684-9033-6 
035 |a (OCoLC)spr568421528 
035 |a (OCoLC)568421528  |z (OCoLC)300764090  |z (OCoLC)861706722  |z (OCoLC)1001504800  |z (OCoLC)1038412120  |z (OCoLC)1039533761  |z (OCoLC)1046617517 
037 |a spr978-1-4684-9033-6 
040 |a OCLCE  |b eng  |e pn  |c OCLCE  |d OCLCQ  |d OCLCO  |d GW5XE  |d OCLCF  |d OCLCQ  |d UAB  |d OCLCQ  |d U3W  |d AU@  |d OCLCO  |d OCLCQ 
041 1 |a eng  |h rus 
042 |a dlr 
049 |a GWRE 
050 4 |a QA267  |b .P753 
130 0 |a Problemy sinteza t︠s︡ifrovykh avtomatov.  |l English.  |0 http://id.loc.gov/authorities/names/n90610390. 
245 1 0 |a Synthesis of digital automata  |h [electronic resource] /  |c Edited by V.G. Lazarev and A.D. Zakrevskii. Translated from Russian by Edwin S. Spiegelthal. 
260 |a New York :  |b Consultants Bureau,  |c 1969. 
300 |a 1 online resource (ix, 172 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent. 
337 |a computer  |b c  |2 rdamedia. 
338 |a online resource  |b cr  |2 rdacarrier. 
500 |a Translation of: Problemy sinteza t︠s︡ifrovykh avtomatov. 
505 0 |a 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. 
520 |a 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. 
588 0 |a Print version record. 
650 0 |a Machine theory.  |0 http://id.loc.gov/authorities/subjects/sh85079341. 
650 7 |a Machine theory.  |2 fast  |0 (OCoLC)fst01004846. 
700 1 |a Lazarev, V. G.  |q (Vladimir Georgievich),  |d 1925-  |e editor.  |0 http://id.loc.gov/authorities/names/n81128230  |1 http://isni.org/isni/0000000109706032. 
700 1 |a Zakrevskiĭ, A. D.,  |e editor.  |0 http://id.loc.gov/authorities/names/n85044442  |1 http://isni.org/isni/0000000117289435. 
776 0 8 |i Print version:  |a Problemy sinteza t︠s︡ifrovykh avtomatov. English.  |t Synthesis of digital automata.  |d New York, Consultants Bureau, 1969  |w (DLC) 69012514  |w (OCoLC)22722. 
856 4 0 |u https://colorado.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-1-4684-9033-6  |z Full Text (via Springer) 
907 |a .b79823853  |b 08-02-21  |c 06-01-15 
998 |a web  |b 07-31-21  |c b  |d b   |e -  |f eng  |g nyu  |h 0  |i 1 
907 |a .b79823853  |b 08-02-21  |c 06-01-15 
944 |a MARS - RDA ENRICHED 
915 |a - 
956 |a Springer e-books 
956 |b Springer Nature - Springer Book Archive - Humanities, Social Science and Law 
956 |b Springer Nature - Springer Book Archive - Humanities, Social Science and Law 
956 |a Humanities Social Science & Law 
956 |a Springer e-books: Archive 
999 f f |i 09f5efbb-4830-510f-b8e5-3427de2c703c  |s acec2bcd-e362-5dc4-a8c3-440a658f09c3 
952 f f |p Can circulate  |a University of Colorado Boulder  |b Online  |c Online  |d Online  |e QA267 .P753  |h Library of Congress classification  |i Ebooks, Prospector  |n 1