The DOI matches its Crossref record.
Formal Languages and their Relation to Automata
Abstract
"Formal Languages and their Relation to Automata." Nuclear Science and Engineering, 40(2), pp. 358–359
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
Cited by
Newell, A. (1980) · Cognitive Science · doi:10.1207/s15516709cog0402_2 · Cited by 1,458
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
A comparison of polynomial time reducibilities
Ladner, R. E., Lynch, N. A., & Selman, A. L. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90016-x · Cited by 408
Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-05445-7_19 · Cited by 274
Metadata
- Authors
- Morris, J. B.
- Venue
- Nuclear Science and Engineering
- Publisher
- Informa UK Limited
- Published
- 1970-05
- Volume
- 40
- Issue
- 2
- Pages
- 358-359
- ISSN
- 0029-5639 (ISSN-L)
- 1943-748X
- OpenAlex
- W2592184324
- Cited by
- 998
- References
- 0
- Type
- book review
- 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: Formal Languages and their Relation to Automata. https://app.cochat.ai/papers/10.13182/nse70-a19706
- The paper
- Morris, J. B. (1970). Formal Languages and their Relation to Automata. Nuclear Science and Engineering. https://doi.org/10.13182/nse70-a19706
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.
