
- 276 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Mathematical Theory of Switching Circuits and Automata
About this book
By applying Boolean algebra to the designing of circuits, C. E. Shannon practically created the switching theory which is necessary to the development of electronic computers. For the next three decades much research was done and most of the major problems of logical design were solved. Recent interest having focused on the purely theoretical aspects of computer and logical networks, Hu now believes that the time has come for a consolidation of the mathematical foundations of the subject.In the present book the author accordingly undertakes to establish a new branch of pure mathematics with a uniform notation and terminology by organizing the past research results into a form usable to both mathematicians and engineers, while simplifying theory by stripping it of complex "hardware" considerations as well as of all unnecessary advanced mathematics.A number of exercises have been provided at the end of each chapter.
By applying Boolean algebra to the designing of circuits, C. E. Shannon practically created the switching theory which is necessary to the development of electronic computers. For the next three decades much research was done and most of the major problem
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- PREFACE
- CONTENTS
- SPECIAL SYMBOLS AND ABBREVIATIONS
- Chapter I. SWITCHING FUNCTIONS
- Chapter II. MINIMIZATION METHODS
- Chapter III. DECOMPOSITION ALGORITHMS
- Chapter IV. SEQUENTIAL MACHINES AND AUTOMATA
- Bibliography
- INDEX