Logic, Automata, and Algorithms

✍ Scribed by Mark A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova and Aleksey A. Tal' (Eds.)

Publisher: Academic Press
Year: 1971
Tongue: English
Leaves: 444
Series: Mathematics in Science and Engineering 79
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Content:
Edited by
Page iii

Copyright page
Page iv

Preface
Pages ix-x

Translator's Note
Page x

Introduction
Pages xi-xii

1 Elements of Mathematical Logic
Pages 1-26

2 Engineering Applications of Propositional Calculus
Pages 27-57

3 Finite Automata and Sequential Machines: Basic Concepts
Pages 58-85

4 Abstract Structure and Nets
Pages 86-115

5 Technical Embodiment of Finite Automata and Sequential Machines
Pages 116-143

6 Autonomous Finite Automata and Sequential Machines
Pages 144-158

7 Representation of Events in Finite Automata and Sequential Machines
Pages 159-186

8 Recognition of Realizability of a Given Specification. Abstract Synthesis of Finite Automata and Sequential Machines
Pages 187-218

9 Equivalence and Minimization of Sequential Machines
Pages 219-259

10 Transformation of Clock Rates of Sequential Machines
Pages 260-283

11 Determination of the Properties of Sequential Machines from Their Response to Finite Input Sequences
Pages 284-303

12 Algorithms
Pages 304-354

13 Turing Machines
Pages 355-376

Conclusion
Pages 377-385

Problems
Pages 386-408

Bibliography Review Article
Pages 409-426

Addenda to Bibliography Review Article
Pages 427-429

Index
Pages 430-433

📜 SIMILAR VOLUMES

Logic, Automata, and Algorithms

📁 Logic, Automata, and Algorithms

✍ Mark A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova and Alekse 📂 Library 📅 1971 🏛 AP 🌐 English

In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrang

Logic, Automata, and Algorithms

📁 Logic, Automata, and Algorithms

✍ Mark A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova and Alekse 📂 Library 📅 1971 🏛 Academic Press 🌐 English

Logik, Automaten, Algorithmen

📁 Logik, Automaten, Algorithmen

✍ M. A. Aiserman; L. A. Gussew; L. I. Rosonoer; I. M. Smirnowa; A. A. Tal 📂 Library 📅 1967 🏛 De Gruyter 🌐 German

Logic and Automata

📁 Logic and Automata

✍ 📂 Library 🌐 English

Algorithms, Languages, Automata and Comp

📁 Algorithms, Languages, Automata and Compilers

✍ Maxim Mozgovoy 📂 Library 📅 2010 🏛 Jones and Bartlett 🌐 English

Logic, Automata, and Computational Compl

📁 Logic, Automata, and Computational Complexity

✍ Bruce M. Kapron, editor 📂 Library 📅 2023 🏛 Association for Computing Machinery 🌐 English

Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and