The DOI matches its Crossref record; 4 of the 4 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.
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
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
Representation of Events in Nerve Nets and Finite Automata
Kleene, S. C. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-002 · Cited by 1,655
Gedanken-Experiments on Sequential Machines
Moore, E. F. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-006 · Cited by 1,387
Linear automaton transformations
Nerode, A. (1958) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1958-0135681-9 · Cited by 541
Cited by
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
On a Decision Method in Restricted Second Order Arithmetic
Büchi, J. R. (1990) · The Collected Works of J. Richard Büchi · doi:10.1007/978-1-4613-8928-6_23 · Cited by 1,271
Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981) · Journal of the ACM · doi:10.1145/322234.322243 · Cited by 1,221
Outline for a Logical Theory of Adaptive Systems
Holland, J. H. (1962) · Journal of the ACM · doi:10.1145/321127.321128 · Cited by 1,112
Derivatives of Regular Expressions
Brzozowski, J. A. (1964) · Journal of the ACM · doi:10.1145/321239.321249 · Cited by 923
Predicting poverty and wealth from mobile phone metadata
Blumenstock, J., Cadamuro, G., & On, R. (2015) · Science · doi:10.1126/science.aac4420 · Cited by 698
The Algebraic Theory of Context-Free Languages
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72023-8 · Cited by 694
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
THE ABSTRACT THEORY OF AUTOMATA
Glushkov, V. M. (1961) · Russian Mathematical Surveys · doi:10.1070/rm1961v016n05abeh004112 · Cited by 482
Algorithms for Finding Patterns in Strings
AHO, A. V. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50010-2 · Cited by 373
On the power of quantum finite state automata
Kondacs, A., & Watrous, J. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646094 · Cited by 346
Where does AlphaGo go: from church-turing thesis to AlphaGo thesis and beyond
Wang, F.-Y., Zhang, J. J., Zheng, X., Wang, X., Yuan, Y., Dai, X., Zhang, J., & Yang, L. (2016) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2016.7471613 · Cited by 342
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…”
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Dissociating Artificial Intelligence from Artificial Consciousness
Findlay, G., Marshall, W., Albantakis, L., David, I., Mayner, W. G., Koch, C., & Tononi, G. (2024) · arXiv · doi:10.48550/arxiv.2412.04571 · Cited by 41
“Turing completeness can be achieved using radically different substrates [72–75], whether simple [46, 76] or complex, feedfor-ward [77] or recurrent [78, 79].”
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
- 4
- 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
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.