On the public citation graph
Identification in the limit of categorial grammars
0 signed · 60 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57370-4_47openalex-snapshot
Properties of language classes with finite elasticity
inferredcites →https://doi.org/10.1007/978-94-010-2506-5_10openalex-snapshot
The Proper Treatment of Quantification in Ordinary English
inferredcites →https://doi.org/10.1007/978-94-015-6878-4openalex-snapshot
Categorial Grammars and Natural Language Structures
inferredcites →https://doi.org/10.1007/978-94-015-6878-4_15openalex-snapshot
Combinators and Grammars
inferredcites →https://doi.org/10.1007/978-94-015-6878-4_4openalex-snapshot
Generative Power of Categorial Grammars
inferredcites →https://doi.org/10.1007/978-94-015-6878-4_7openalex-snapshot
Type Raising, Functional Composition, and Non-Constituent Conjunction
inferredcites →https://doi.org/10.1007/bf00134555openalex-snapshot
Combinatory grammars and parasitic gaps
inferredcites →https://doi.org/10.1007/bf00370157openalex-snapshot
Categorial grammars determined from linguistic data by unification
inferredcites →https://doi.org/10.1007/bf03037094openalex-snapshot
Inductive inference of monotonic formal systems from positive data
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/0890-5401(92)90003-xopenalex-snapshot
Efficient learning of context-free grammars from positive structural examples
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(78)90849-5openalex-snapshot
Skeletal structural descriptions
inferredcites →https://doi.org/10.1016/s0019-9958(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1080/00029890.1958.11989160openalex-snapshot
The Mathematics of Sentence Structure
inferredcites →https://doi.org/10.1086/287266openalex-snapshot
Some Linguistic Problems Connected with Machine Translation
inferredcites →https://doi.org/10.1145/322326.322334openalex-snapshot
Inference of Reversible Languages
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.2307/2185417openalex-snapshot
Knowledge of Language: Its Nature, Origin, and Use.
inferredcites →https://doi.org/10.2307/410452openalex-snapshot
A Quasi-Arithmetical Notation for Syntactic Description
inferredcites →https://doi.org/10.2307/414105openalex-snapshot
Formal principles of language acquisition . By Kenneth Wexler and Peter W. Culicover. Cambridge, MA: MIT Press, 1980. Pp. xvii, 647. $35.00.
inferredcites →https://doi.org/10.2307/414385openalex-snapshot
Dependency and coürdination in the grammar of Dutch and English
inferredcites →https://doi.org/10.5555/114836.114871openalex-snapshot
The correct definition of finite elasticity: corrigendum to identification of unions
inferredcites →https://doi.org/10.5555/92571.92593openalex-snapshot
Inductive inference from positive data is powerful
inferredcites →https://doi.org/10.5555/93335.93373openalex-snapshot
Identification of unions of languages drawn from an identifiable class
inferredcites →https://doi.org/10.7551/mitpress/3897.001.0001openalex-snapshot
An Introduction to Computational Learning Theory
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-540-88009-7_16openalex-snapshot
How to Split Recursive Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_7openalex-snapshot
Learning Left-to-Right and Right-to-Left Iterative Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_30openalex-snapshot
Tarski’s Principle, Categorial Grammars and Learnability
inferred← citeshttps://doi.org/10.1007/978-94-011-5108-5_19openalex-snapshot
Polish Logic, Language and Philosophy of Language
inferred← citeshttps://doi.org/10.1007/bf02678880openalex-snapshot
Adaptive communication among collaborative agents: preliminary results with symbol grounding
inferred← citeshttps://doi.org/10.1007/bfb0052163openalex-snapshot
Connected sets of types and categorial consequence
inferred← citeshttps://doi.org/10.1007/s10849-025-09445-9openalex-snapshot
On the expressive power of categorial grammars with unique category assignment
inferred← citeshttps://doi.org/10.1007/s11225-007-9036-yopenalex-snapshot
On Learnability of Restricted Classes of Categorial Grammars
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.029openalex-snapshot
Identification of biRFSA languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00266-1openalex-snapshot
Algebraic structures in categorial grammar
inferred← citeshttps://doi.org/10.1023/a:1004926032425openalex-snapshot
Infinite Set Unification with Application to Categorial Grammar
inferred← citeshttps://doi.org/10.1023/a:1010826628977openalex-snapshot
Learning Regular Languages from Simple Positive Examples
inferred← citeshttps://doi.org/10.1073/pnas.2021865119openalex-snapshot
One model for the learning of language
inferred← citeshttps://doi.org/10.1080/11663081.1994.10510831openalex-snapshot
Learning categorial grammar by unification with negative constraints
inferred← citeshttps://doi.org/10.1134/s1064562425700188openalex-snapshot
Algorithmic Properties of Basic Categorial Grammars with Unique Category Assignment
inferred← citeshttps://doi.org/10.1163/9789004311763_004openalex-snapshot
Syntactic Categories and Types: Ajdukiewicz and Modern Categorial Grammars
inferred← citeshttps://doi.org/10.1515/slgr-2015-0029openalex-snapshot
On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations
inferred← citeshttps://doi.org/10.25130/jls.7.1.16openalex-snapshot
Systematicity of Language and Mathematics in Language Learning Faculty
inferred← citeshttps://doi.org/10.3115/1603899.1603955openalex-snapshot
Syntactico-semantic learning of categorial grammars
inferred← citeshttps://doi.org/10.31219/osf.io/y4uswopenalex-snapshot
Complexity of Grammar Induction for Quantum Types
inferred← citeshttps://doi.org/10.3166/ria.20.775-804openalex-snapshot
Learning Recursive Automata from Positive Examples
inferred← citeshttps://doi.org/10.3233/fun-2002-49403openalex-snapshot
Optimal Unification and Learning Algorithms for Categorial Grammars
inferred← citeshttps://doi.org/10.3233/fun-2004-623-407openalex-snapshot
Optimal Unification of Infinite Sets of Types
inferred← citeshttps://doi.org/10.3406/hel.2009.3109openalex-snapshot
Mathematics of language learning
inferred← citeshttps://doi.org/10.4204/eptcs.172.16openalex-snapshot
Complexity of Grammar Induction for Quantum Types
inferred← citeshttps://doi.org/10.53437/nhpa7366openalex-snapshot
Towards a Semantic-based Theory of Language Learning
inferred← citeshttps://doi.org/10.53437/zrgvzd20openalex-snapshot
Grammatical Inference by specialization as a state splitting strategy
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.