On the public citation graph

Learning Linearly Separable 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.
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.1006/inco.1994.1097openalex-snapshot
Predicting {0, 1}-Functions on Randomly Drawn Points
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/3-540-07407-4_23openalex-snapshot
Piecewise testable events
inferredcites →https://doi.org/10.1007/3-540-44669-9_33openalex-snapshot
Piecewise and Local Threshold Testability of DFA
inferredcites →https://doi.org/10.1007/978-3-662-07675-0openalex-snapshot
Handbook of Formal Languages
inferredcites →https://doi.org/10.1007/bf00994018openalex-snapshot
Support-Vector Networks
inferredcites →https://doi.org/10.1016/b978-1-4832-2973-7.50001-8openalex-snapshot
Fundamental Studies in Computer Science
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)90562-4openalex-snapshot
Complexity of automaton identification from given data
inferredcites →https://doi.org/10.1016/s0019-9958(78)90683-6openalex-snapshot
On the complexity of minimum inference of regular sets
inferredcites →https://doi.org/10.1016/s0019-9958(81)90090-5openalex-snapshot
A note on the number of queries needed to identify regular languages
inferredcites →https://doi.org/10.1016/s0021-9800(69)80111-0openalex-snapshot
On free monoids partially ordered by embedding
inferredcites →https://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
inferredcites →https://doi.org/10.1023/a:1009715923555openalex-snapshot
A Tutorial on Support Vector Machines for Pattern Recognition
inferredcites →https://doi.org/10.1023/a:1010822518073openalex-snapshot
Learning DFA from Simple Examples
inferredcites →https://doi.org/10.1080/00401706.1999.10485951openalex-snapshot
Statistical Learning Theory
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/34.211465openalex-snapshot
Learning subsequential transducers for pattern recognition interpretation tasks
inferredcites →https://doi.org/10.1109/sfcs.1987.21openalex-snapshot
Diversity-based inference of finite automata
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1145/130385.130401openalex-snapshot
A training algorithm for optimal margin classifiers
inferredcites →https://doi.org/10.1145/138027.138042openalex-snapshot
The minimum consistent DFA problem cannot be approximated within any polynomial
inferredcites →https://doi.org/10.1145/167088.167191openalex-snapshot
Efficient learning of typical finite automata from random walks
inferredcites →https://doi.org/10.1145/225298.225302openalex-snapshot
On the learnability and usage of acyclic probabilistic finite automata
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/322326.322334openalex-snapshot
Inference of Reversible Languages
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.25596/jalc-2001-437openalex-snapshot
The Boolean Structure of Dot-Depth One
inferredcites →https://doi.org/10.5555/299094openalex-snapshot
Advances in kernel methods: support vector learning
inferredcites →https://doi.org/10.7551/mitpress/1130.003.0007openalex-snapshot
Generalization Performance of Support Vector Machines and Other Pattern Classifiers
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/11871842_13openalex-snapshot
Languages as Hyperplanes: Grammatical Inference with String Kernels
inferred← citeshttps://doi.org/10.1007/11872436_13openalex-snapshot
Planar Languages and Learnability
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_26openalex-snapshot
Learning Languages with Rational Kernels
inferred← citeshttps://doi.org/10.1007/978-3-642-14322-9_19openalex-snapshot
On Languages Piecewise Testable in the Strict Sense
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_12openalex-snapshot
On the Learnability of Shuffle Ideals
inferred← citeshttps://doi.org/10.1007/s10994-010-5218-3openalex-snapshot
Languages as hyperplanes: grammatical inference with string kernels
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.037openalex-snapshot
Kernel methods for learning languages
inferred← citeshttps://doi.org/10.3233/fun-2008-843-401openalex-snapshot
Some Alternatives to Parikh Matrices Using String Kernels
inferred← citeshttps://doi.org/10.3406/hel.2009.3109openalex-snapshot
Mathematics of language learning
inferred← citeshttps://doi.org/10.48550/arxiv.1409.3943openalex-snapshot
Alternating Towers and Piecewise Testable Separators
inferred← citeshttps://doi.org/10.7551/mitpress/10290.001.0001openalex-snapshot
Foundations of Machine Learning
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.