On the public citation graph
PAC-Learning Unambiguous NTS Languages
0 signed · 42 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.1002/(sici)1098-2418(199809)13:2<99::aid-rsa1>3.0.co;2-mopenalex-snapshot
Balls and bins: A study in negative dependence
inferredcites →https://doi.org/10.1006/jcss.1997.1555openalex-snapshot
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
inferredcites →https://doi.org/10.1007/11564089_23openalex-snapshot
Identification in the Limit of Substitutable Context-Free Languages
inferredcites →https://doi.org/10.1007/s10994-006-9592-9openalex-snapshot
Learning deterministic context free grammars: The Omphalos competition
inferredcites →https://doi.org/10.1016/0022-0000(85)90055-8openalex-snapshot
The equivalence and inclusion problems for NTS languages
inferredcites →https://doi.org/10.1016/0022-0000(85)90056-xopenalex-snapshot
NTS languages are deterministic and congruential
inferredcites →https://doi.org/10.1080/00437956.1954.11659520openalex-snapshot
Distributional Structure
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.3115/1073012.1073029openalex-snapshot
Immediate-head parsing for language models
inferredcites →https://doi.org/10.3115/1220355.1220368openalex-snapshot
Partially distribution-free learning of regular languages from positive samples
inferredcites →https://doi.org/10.48550/arxiv.cs/0001023openalex-snapshot
Structured Language Modeling for Speech Recognition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781444324044.ch8openalex-snapshot
Unsupervised Learning and Grammar Induction
inferred← citeshttps://doi.org/10.1007/11871842_13openalex-snapshot
Languages as Hyperplanes: Grammatical Inference with String Kernels
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_21openalex-snapshot
Identification in the Limit of k,l-Substitutable Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_3openalex-snapshot
A Polynomial Algorithm for the Inference of Context Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_24openalex-snapshot
Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_2openalex-snapshot
Three Learnable Models for the Description of Language
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_11openalex-snapshot
PAC-Learning Unambiguous k,l-NTS ≤ Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_12openalex-snapshot
Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_5openalex-snapshot
Learning Context Free Grammars with the Syntactic Concept Lattice
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_2openalex-snapshot
Towards General Algorithms for Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-16184-1_29openalex-snapshot
Towards General Algorithms for Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-23211-4_3openalex-snapshot
A Language Theoretic Approach to Syntactic Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-32024-8_13openalex-snapshot
Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_11openalex-snapshot
PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_6openalex-snapshot
Distributional Learning of Context-Free and Multiple Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/s10994-010-5218-3openalex-snapshot
Languages as hyperplanes: grammatical inference with string kernels
inferred← citeshttps://doi.org/10.1007/s10994-021-06034-2openalex-snapshot
Learning (k,l)-context-sensitive probabilistic grammars with nonparametric Bayesian approach
inferred← citeshttps://doi.org/10.1016/j.plrev.2007.10.001openalex-snapshot
Behavioral and computational aspects of language and its acquisition
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.058openalex-snapshot
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.037openalex-snapshot
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
inferred← citeshttps://doi.org/10.1017/s0022226707004628openalex-snapshot
Machine learning theory and practice as a source of insightinto universal grammar
inferred← citeshttps://doi.org/10.1017/s0305000910000024openalex-snapshot
An empirical generative framework for computational modeling of language acquisition
inferred← citeshttps://doi.org/10.1109/spw.2016.26openalex-snapshot
Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec
inferred← citeshttps://doi.org/10.1111/tops.12001openalex-snapshot
Complexity in Language Acquisition
inferred← citeshttps://doi.org/10.1146/annurev-linguistics-011516-034008openalex-snapshot
Computational Learning of Syntax
inferred← citeshttps://doi.org/10.2200/s00643ed1v01y201504hlt028openalex-snapshot
Grammatical Inference for Computational Linguistics
inferred← citeshttps://doi.org/10.3115/1705475.1705484openalex-snapshot
Upper bounds for unsupervised parsing with unambiguous non-terminally separated grammars
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.