The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Finite Automata and Their Decision Problems
Abstract
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.
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
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Cited by
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
Predicting poverty and wealth from mobile phone metadata
Blumenstock, J., Cadamuro, G., & On, R. (2015) · Science · doi:10.1126/science.aac4420 · Cited by 698
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
Krohn, K., & Rhodes, J. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0188316-1 · Cited by 327
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
A bird's eye view of human language evolution
Berwick, R. C., Beckers, G. J. L., Okanoya, K., & Bolhuis, J. J. (2012) · Frontiers in Evolutionary Neuroscience · doi:10.3389/fnevo.2012.00005 · Cited by 81
“Long-standing results (Chomsky,1956; Rabin and Scott, 1959) demonstrate that such patterns cannot be generated by any finite-state transition network, because, for example, in order ensure that each warble i on the left is matched with its corresponding rattle i on the right one must in effect be able to match up warb…”
Metadata
- Authors
- Rabin, M. O., & Scott, D.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1959-04
- Volume
- 3
- Issue
- 2
- Pages
- 114-125
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2054801208
- Cited by
- 1,879
- References
- 1
- FWCI
- 17.76
- Type
- journal article
- 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: Finite Automata and Their Decision Problems. https://app.cochat.ai/papers/10.1147/rd.32.0114
- The paper
- Rabin, M. O., & Scott, D. (1959). Finite Automata and Their Decision Problems. IBM Journal of Research and Development. https://doi.org/10.1147/rd.32.0114
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.
