My Account Log in

2 options

Mathematical Theory of Switching Circuits and Automata / Sze-Tsen Hu.

De Gruyter University of California Press eBook-Package Archive Pre-2000 Available online

View online

EBSCOhost Academic eBook Collection (North America) Available online

View online
Format:
Book
Author/Creator:
Hu, S. T. (Sze-Tsen), 1914-1999, author.
Language:
English
Subjects (All):
Machine theory.
Switching theory.
Physical Description:
1 online resource (280 p.)
Edition:
First edition.
Place of Publication:
Berkeley : University of California Press, [1968]
Language Note:
In English.
Summary:
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. This title is part of UC Press's Voices Revived program, which commemorates University of California Press's mission to seek out and cultivate the brightest minds and give them voice, reach, and impact. Drawing on a backlist dating to 1893, Voices Revived makes high-quality, peer-reviewed scholarship accessible once again using print-on-demand technology. This title was originally published in 1968.
Contents:
Frontmatter
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
Notes:
Includes bibliographical references and index.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Sep 2020)
Description based on print version record.
ISBN:
9780520310896
0520310896
OCLC:
1198930144

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account