Abstract :
This book is intended to cover the spectrum of undergraduate and graduate switching theory from combinational logic, through synchronous and asynchronous sequential machines, to finite automata. The treatment is comprehensive, but many of the discussions are brief. The book contains 16 chapters, each with from 20 to 30 homework problems. Course instructors can obtain a solutions manual from the publisher.