Format:
Online Ressource (xii, 433 pages)
,
illustrations.
Edition:
Online-Ausg.
ISBN:
0120463504
,
9780120463503
,
9780080955872
,
0080955878
Series Statement:
Mathematics in science and engineering vol. 79
Content:
Elements of mathematical logic -- Engineering applications of propositional calculus -- Finite automata and sequential machines ; basic concepts -- Abstract structure and nets -- Technical embodiment of finite automata and sequential machines -- Autonomous finite automata and sequential machines -- Representation of events in finite automata and sequential machines -- Recognition of realizability of a given specification, abstratc synthesis of finite automata and sequential machines -- Equivalence and minimization of sequential machines -- Transformation of clock rates of sequential machines -- Determination of the properties of sequential machines from their response to finite input sequences -- Algorithms -- Turing machines -- Conclusion -- Problems
Note:
Originally published as 'Logika, avtomaty, algoritmy'. Moscow: Literatury, 1963. - Includes bibliographical references and index. - Print version record
,
Front Cover; Logic, Automata, and Algorithms; Copyright Page; Contents; Preface; Translator's Note; Introduction; Chapter 1. Elements of Mathematical Logic; 1.1 Introductory Notes; 1.2 Basic Concepts; 1.3 Propositional Calculus; 1.4 Two-Valued Predicate Calculus; Chapter 2. Engineering Applications of Propositional Calculus; 2.1 Combinational Relay Switching Circuits; 2.2 Analysis of Combinational Relay Switching Circuits; 2.3 Synthesis of Combinational Relay Switching Circuits; 2.4 Other Methods for Converting Logical Functions into Practical Devices
,
2.5 The Problem of Minimization of Devices Performing Logical FunctionsChapter 3. Finite Automata and Sequential Machines: Basic Concepts; 3.1 Discrete Time and Discrete Time Moments; 3.2 On Dynamical Systems; 3.3 Finite Automata; 3.4 Sequential Machines; 3.5 Techniques for Defining Finite Automata and Sequential Machines; 3.6 Recording the Operation of an Automaton; 3.7 On the Restriction of Input Sequences; Chapter 4. Abstract Structure and Nets; 4.1 The Concept of Substitution of Sequential Machines; 4.2 The Abstract Structure of the Automaton; 4.3 Nets
,
4.4 Abstract Aggregates of Automata and Sequential Machines4.5 Abstract Neurons and Models of Neural Nets; Chapter 5. Technical Embodiment of Finite Automata and Sequential Machines; 5.1 Two Methods for Technical Realization of Finite Automata and sequential Machines; 5.2 Aggregative Design of Finite Automata and Sequential Machines.; 5.3 Synthesis of Finite Automata and Sequential Machines by Utilizing Inherent Delays as Well as Feedback.; 5.4 Huffman's Method and Realization; Chapter 6. Autonomous Finite Automata and Sequential Machines
,
6.1 What Autonomous Finite Automata and Sequential Machines "Can Do"6.2 Synthesis of the Bistable Structure of an Autonomous Sequential Machine; Chapter 7. Representation of Events in Finite Automata and Sequential Machines; 7.1 Statement of the Problem; 7.2 Events. Representation of Events.; 7.3 Operations on Sets of Input Sequences; 7.4 Representability of Regular Events; 7.5 Regularity of Representable Events; 7.6 Do Irregular (Unrepresentable) Events Exist?; 7.7 What a Finite Automaton "Can Do"
,
Chapter 8. Recognition of Realizability of a Given Specification. Abstract Synthesis of Finite Automata and Sequential Machines8.1 Statement of the Problem; 8.2 The Case Where the Specification Enumerates the Required Input-Output Correspondences; 8.3 Algorithmic Unsolvability of the Problem of Recognition of Representability of Recursive Events; 8.4 Synthesis of Finite Automata and Sequential Machines in the Language of Regular Expressions; Chapter 9. Equivalence and Minimization of Sequential Machines; 9.1 The Problem of Recognition of Equivalent States
,
9.2 Algorithmic Unsolvability of the Generalized Recognition Problem of Recognition of Equivalence of States
,
Elements of mathematical logic -- Engineering applications of propositional calculus -- Finite automata and sequential machines ; basic concepts -- Abstract structure and nets -- Technical embodiment of finite automata and sequential machines -- Autonomous finite automata and sequential machines -- Representation of events in finite automata and sequential machines -- Recognition of realizability of a given specification, abstratc synthesis of finite automata and sequential machines -- Equivalence and minimization of sequential machines -- Transformation of clock rates of sequential machines -- Determination of the properties of sequential machines from their response to finite input sequences -- Algorithms -- Turing machines -- Conclusion -- Problems.
Additional Edition:
ISBN 0120463504
Additional Edition:
ISBN 0080955878
Additional Edition:
Erscheint auch als Druck-Ausgabe Logic, automata, and algorithms New York ; London : Academic Press, 1971
Language:
English
Keywords:
Electronic books
;
Electronic books
Author information:
Ajzerman, Mark A. 1913-1992
