The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
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
Introduction to switching and automata theory
Harrison, M. A. (1965) · Medical Entomology and Zoology · Cited by 370
Introduction to the Theory of Switching Circuits
Cattermole, K. W. (1966) · Electronics and Power · doi:10.1049/ep.1966.0295 · Cited by 260
Cited by
Principles and methods of testing finite state machines-a survey
Lee, D., & Yannakakis, M. (1996) · Proceedings of the IEEE · doi:10.1109/5.533956 · Cited by 1,228
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Self-citationComputation theory of cellular automata
Wolfram, S. (1984) · Communications in Mathematical Physics · doi:10.1007/bf01217347 · Cited by 625
Computational Generation of Referring Expressions: A Survey
Krahmer, E., & van Deemter, K. (2012) · Computational Linguistics · doi:10.1162/coli_a_00088 · Cited by 325
Semantic-based Automated Reasoning for AWS Access Policies using SMT
Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K., Rungta, N., Tkachuk, O., & Varming, C. (2018) · 2018 Formal Methods in Computer Aided Design (FMCAD) · doi:10.23919/fmcad.2018.8602994 · Cited by 106
Metadata
- Authors
- Hopcroft, J.
- Venue
- Theory of Machines and Computations
- Publisher
- Elsevier
- Published
- 1971
- Pages
- 189-196
- OpenAlex
- W2122493035
- Cited by
- 747
- References
- 2
- FWCI
- 9.60
- Type
- book chapter
- 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: AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON. https://app.cochat.ai/papers/10.1016/b978-0-12-417750-5.50022-1
- The paper
- Hopcroft, J. (1971). AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON. Theory of Machines and Computations. https://doi.org/10.1016/b978-0-12-417750-5.50022-1
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.