The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Grammatical Inference: Introduction and Survey - Part I
Abstract
The problem of grammatical inference is introduced, and its potential engineering applications are demonstrated. Inference algorithms for finite-state and context-free grammars are presented. The application of some of the algorithms to the inference of pattern grammars in syntactic pattern recognition is illustrated by examples.
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
ASPECTS OF THE THEORY OF SYNTAX
Chomsky, N. (1964) · doi:10.21236/ad0616323 · Cited by 13,587
Outline of a New Approach to the Analysis of Complex Systems and Decision Processes
Zadeh, L. A. (1973) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1973.5408575 · Cited by 8,721
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
On the Synthesis of Finite-State Machines from Samples of Their Behavior
Biermann, A. W., & Feldman, J. A. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009015 · Cited by 510
Algebraic structure theory of sequential machines
Hopcroft, J. E. (1967) · Journal of the Franklin Institute · doi:10.1016/0016-0032(67)90243-8 · Cited by 380
Sequential Machines and Automata Theory
Cooper, D. C. (1968) · The Computer Journal · doi:10.1093/comjnl/11.2.176 · Cited by 282
A study of grammatical inference
Horning, J. J. (1969) · Defense Technical Information Center (DTIC) · Cited by 232
Cited by
Progress in supervised neural networks
Hush, D. R., & Horne, B. G. (1993) · IEEE Signal Processing Magazine · doi:10.1109/79.180705 · Cited by 1,247
Formal models of language learning
Pinker, S. (1979) · Cognition · doi:10.1016/0010-0277(79)90001-5 · Cited by 547
Probabilistic finite-state machines - part I
Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., & Carrasco, R. C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.147 · Cited by 301
Gazdar, G. (1982) · The Nature of Syntactic Representation · doi:10.1007/978-94-009-7707-5_5 · Cited by 262
Metadata
- Authors
- Fu, K.-S., & Booth, T. L.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1975-01
- Volume
- SMC-5
- Issue
- 1
- Pages
- 95-111
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2026740477
- Cited by
- 270
- References
- 23
- FWCI
- 14.79
- 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.