Mathematical Theory of Switching Circuits and Automata

Sze-Tsen Hu · 1968

The purpose of this volume is to organize the existing results about switching circuits and automata as a branch of pure mathematics with uniformized notation and terminology, and to simplify the theory not obscured by the complexity of hardware. Within this book there are four chapters of approximately equal length. The first three chapters cover combinational circuits and are entitled 'Switching Functions,' 'Minimization Methods,' and 'Decomposition Algorithms.' The final chapter is devoted to the theory of sequential circuits and is entitled 'Sequential Machines and Automata.' (Author)

Read the paper · More papers on PaperTik