The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
Crytographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. G. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73049 · Cited by 266
Finite automata; behavior and synthesis
Trakhtenbrot, B. A., & Barzdinʹ, I. M. (1973) · Medical Entomology and Zoology · Cited by 253
On the complexity of minimum inference of regular sets
Angluin, D. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90683-6 · Cited by 251
Efficient learning of typical finite automata from random walks
Freund, Y., Kearns, M. J., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. M. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167191 · Cited by 57
Cited by
Guided GUI testing of android apps with minimal restart and approximate learning
Choi, W., Necula, G., & Sen, K. (2013) · Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications · doi:10.1145/2509136.2509552 · Cited by 315
Inferring extended finite state machine models from software executions
Walkinshaw, N., Taylor, R., & Derrick, J. (2016) · Empirical Software Engineering · doi:10.1007/s10664-015-9367-7 · Cited by 127
Learning State Machines to Monitor and Detect Anomalies on a Kubernetes Cluster
Cao, C., Blaise, A., Verwer, S., & Rebecchi, F. (2022) · Proceedings of the 17th International Conference on Availability, Reliability and Security · doi:10.1145/3538969.3543810 · Cited by 27
(2019) · Cited by 3
Metadata
- Authors
- Lang, K. J., Pearlmutter, B. A., & Price, R. A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 1-12
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1559171143
- Cited by
- 334
- References
- 5
- FWCI
- 6.10
- Type
- conference paper
- 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: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. https://app.cochat.ai/papers/10.1007/bfb0054059
- The paper
- Lang, K. J., Pearlmutter, B. A., & Price, R. A. (1998). Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. Lecture Notes in Computer Science. https://doi.org/10.1007/bfb0054059
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.