The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Switching and Finite Automata Theory
Abstract
Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ERROR DETECTING AND ERROR CORRECTING CODES
Chauhan, N., Yadav, P., & Kumari, P. (2014) · Cited by 3,270
Reichel, E. (1909) · Cited by 1,533
Minimization of Boolean Functions*
McCluskey, E. J. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03835.x · Cited by 1,230
Computer Arithmetic Algorithms
Koren, I. (2018) · A K Peters/CRC Press eBooks · doi:10.1201/9781315275567 · Cited by 1,221
The Problem of Simplifying Truth Functions
Quine, W. V. (1952) · The American Mathematical Monthly · doi:10.1080/00029890.1952.11988183 · Cited by 894
The Synthesis of Two-Terminal Switching Circuits
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb03624.x · Cited by 802
A Way to Simplify Truth Functions
Quine, W. V. (1955) · The American Mathematical Monthly · doi:10.1080/00029890.1955.11988710 · Cited by 633
The map method for synthesis of combinational logic circuits
Karnaugh, M. (1953) · Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics · doi:10.1109/tce.1953.6371932 · Cited by 624
MINI: A Heuristic Approach for Logic Minimization
Hong, S. J., Cain, R. G., & Ostapko, D. L. (1974) · IBM Journal of Research and Development · doi:10.1147/rd.185.0443 · Cited by 346
A chart method for simplifying truth functions
Veitch, E. W. (1952) · ACM National Meeting · doi:10.1145/609784.609801 · Cited by 150
Cited by
The Concept of a Linguistic Variable and Its Application to Approximate Reasoning—I
Zadeh, L. A. (1975) · Information Sciences · doi:10.1016/0020-0255(75)90036-5 · Cited by 12,187
The Concept of a Linguistic Variable and Its Application to Approximate Reasoning—II
Zadeh, L. A. (1975) · Information Sciences · doi:10.1016/0020-0255(75)90046-8 · Cited by 2,555
A fuzzy-algorithmic approach to the definition of complex or imprecise concepts
Zadeh, L. A. (1976) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(76)80001-6 · Cited by 668
QoE Evaluation Based on QoS and QoBiz Parameters Applied to an OTT Service
Rivera, D., Kushik, N., Fuenzalida, C., Cavalli, A., & Yevtushenko, N. (2015) · 2015 IEEE International Conference on Web Services · doi:10.1109/icws.2015.86 · Cited by 11
Metadata
- Authors
- Kohavi, Z., & Jha, N. K.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2009-10-22
- OpenAlex
- W1543281322
- Cited by
- 1,766
- References
- 10
- FWCI
- 12.54
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Switching and Finite Automata Theory. https://app.cochat.ai/papers/10.1017/cbo9780511816239
- The paper
- Kohavi, Z., & Jha, N. K. (2009). Switching and Finite Automata Theory. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511816239
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
