On the public citation graph

Why it might pay to assume that languages are infinite

https://doi.org/10.1007/bf02451546
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-011-3818-5_26openalex-snapshot
Infinity is in the Eye of the Beholder
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(67)90546-3openalex-snapshot
On the size of machines
inferredcites →https://doi.org/10.1016/s0019-9958(72)90592-xopenalex-snapshot
Program size in restricted programming languages
inferredcites →https://doi.org/10.1016/s0019-9958(76)90173-xopenalex-snapshot
A note on the succinctness of descriptions of deterministic languages
inferredcites →https://doi.org/10.1109/sfcs.1975.12openalex-snapshot
Economy of description by parsers, DPDA's, and PDA's
inferredcites →https://doi.org/10.1109/swat.1971.11openalex-snapshot
Economy of description by automata, grammars, and formal systems
inferredcites →https://doi.org/10.3115/981175.981191openalex-snapshot
On the succinctness properties of unordered context-free grammars

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_5openalex-snapshot
Contextual Grammars and Natural Languages
inferred← citeshttps://doi.org/10.1007/978-94-011-4231-1_6openalex-snapshot
Minimum Description Length and Compositionality
inferred← citeshttps://doi.org/10.1007/bf00985572openalex-snapshot
From compositional to systematic semantics
inferred← citeshttps://doi.org/10.1007/s10988-016-9193-4openalex-snapshot
Scientific modelling in generative grammar and the dynamic turn in syntax
inferred← citeshttps://doi.org/10.1007/s11229-017-1574-xopenalex-snapshot
Infinity and the foundations of linguistics
inferred← citeshttps://doi.org/10.1007/s42113-024-00196-7openalex-snapshot
Plausibility and Early Theory in Linguistics and Cognitive Science
inferred← citeshttps://doi.org/10.1016/j.neucom.2007.05.006openalex-snapshot
On the implicit acquisition of a context-free grammar by a simple recurrent neural network
inferred← citeshttps://doi.org/10.1017/9781009491952openalex-snapshot
The Philosophy of Linguistics
inferred← citeshttps://doi.org/10.1017/s0022226724000240openalex-snapshot
Pullum’s philosophy of linguistics: towards a unified framework
inferred← citeshttps://doi.org/10.1017/s0952675717000112openalex-snapshot
Computational phonology today
inferred← citeshttps://doi.org/10.1073/pnas.2021865119openalex-snapshot
One model for the learning of language
inferred← citeshttps://doi.org/10.1080/09540090500317291openalex-snapshot
Stack-like and queue-like dynamics in recurrent neural networks
inferred← citeshttps://doi.org/10.1093/bjps/46.4.475openalex-snapshot
On Explanation in the Cognitive Sciences: Competence, Idealization, and the Failure of the Classical Cascade
inferred← citeshttps://doi.org/10.1098/rsos.191772openalex-snapshot
What can formal language theory do for animal cognition studies?
inferred← citeshttps://doi.org/10.1098/rstb.2019.0050openalex-snapshot
Some cautions regarding the phonological continuity hypothesis
inferred← citeshttps://doi.org/10.1162/ling_a_00214openalex-snapshot
Finite-State Phonology Predicts a Typological Gap in Cyclic Stress Assignment
inferred← citeshttps://doi.org/10.1162/ling_a_00265openalex-snapshot
Strict Locality and Phonological Maps
inferred← citeshttps://doi.org/10.1371/journal.pone.0145289openalex-snapshot
A Corpus Investigation of Syntactic Embedding in Pirahã
inferred← citeshttps://doi.org/10.1515/tl-2022-2043openalex-snapshot
Diving deeper into subregular syntax
inferred← citeshttps://doi.org/10.15398/jlm.v11i1.342openalex-snapshot
On regular copying languages
inferred← citeshttps://doi.org/10.18653/v1/2021.sigmorphon-1.2openalex-snapshot
Recursive prosody is not finite-state
inferred← citeshttps://doi.org/10.48550/arxiv.cmp-lg/9505019openalex-snapshot
Measuring semantic complexity
inferred← citeshttps://doi.org/10.5565/rev/catjl.354openalex-snapshot
Computational Perspectives on Phonological Constituency and Recursion
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.