On the public citation graph

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

https://doi.org/10.1007/bf01007463
0 signed · 52 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/3-540-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferredcites →https://doi.org/10.1007/bf00058753openalex-snapshot
Learning Syntax by Automata Induction
inferredcites →https://doi.org/10.1007/bf00114841openalex-snapshot
Learning automata from ordered examples
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferredcites →https://doi.org/10.1016/0020-0190(90)90074-8openalex-snapshot
The grammatical inference problem for the Szilard languages of linear grammars
inferredcites →https://doi.org/10.1016/0031-3203(79)90009-8openalex-snapshot
Syntactic Pattern Recognition: An introduction
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/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
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(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/322326.322334openalex-snapshot
Inference of Reversible Languages
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.21236/ada206851openalex-snapshot
Learning Automata from Ordered Examples

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1996.0051openalex-snapshot
Incremental Learning from Positive Data
inferred← citeshttps://doi.org/10.1007/11564089_23openalex-snapshot
Identification in the Limit of Substitutable Context-Free Languages
inferred← citeshttps://doi.org/10.1007/11872436_14openalex-snapshot
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_16openalex-snapshot
Stochastic k-testable Tree Languages and Applications
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_15openalex-snapshot
Locality, Reversibility, and Beyond: Learning Languages from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_25openalex-snapshot
Grammatical inference: An old and new paradigm
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_35openalex-snapshot
Identifiability of subspaces and homomorphic images of zero-reversible languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_20openalex-snapshot
eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_13openalex-snapshot
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_18openalex-snapshot
Probabilistic k-Testable Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_6openalex-snapshot
Inferring Subclasses of Contextual Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_20openalex-snapshot
Learning Efficiency of Very Simple Grammars from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_34openalex-snapshot
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_2openalex-snapshot
Efficiency in the Identification in the Limit Learning Paradigm
inferred← citeshttps://doi.org/10.1007/bfb0033356openalex-snapshot
Learning code regular and code linear languages
inferred← citeshttps://doi.org/10.1007/bfb0054078openalex-snapshot
Learning a subclass of context-free languages
inferred← citeshttps://doi.org/10.1007/s10462-010-9199-1openalex-snapshot
A survey of grammatical inference methods for natural language learning
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.023openalex-snapshot
The efficiency of identifying timed automata and the power of clocks
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.024openalex-snapshot
Smoothing and compression with stochastic -testable tree languages
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.008openalex-snapshot
A survey of grammatical inference in software engineering
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.029openalex-snapshot
Identification of biRFSA languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.012openalex-snapshot
Learning efficiency of very simple grammars from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00423-1openalex-snapshot
Polynomial-time identification of very simple grammars from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferred← citeshttps://doi.org/10.1023/a:1010826628977openalex-snapshot
Learning Regular Languages from Simple Positive Examples
inferred← citeshttps://doi.org/10.1080/00207169608804510openalex-snapshot
A family of languages which is polynomial-time learnable from positive data in pitt's sense
inferred← citeshttps://doi.org/10.1080/00207169908804778openalex-snapshot
Inferring regular languages by merging nonterminals
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.6.1704openalex-snapshot
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
inferred← citeshttps://doi.org/10.1109/34.722617openalex-snapshot
Learning local languages and their application to DNA sequence analysis
inferred← citeshttps://doi.org/10.1109/acmc.2014.7065802openalex-snapshot
Learning of P systems for subclass of pattern languages
inferred← citeshttps://doi.org/10.1109/tpami.2005.144openalex-snapshot
Parsing with probabilistic strictly locally testable tree languages
inferred← citeshttps://doi.org/10.1109/tsmcb.2011.2155057openalex-snapshot
A Learning Algorithm for Multimodal Grammar Inference
inferred← citeshttps://doi.org/10.1142/s0218194020400203openalex-snapshot
Regular Expression Learning from Positive Examples Based on Integer Programming
inferred← citeshttps://doi.org/10.3166/ria.20.775-804openalex-snapshot
Learning Recursive Automata from Positive Examples
inferred← citeshttps://doi.org/10.37936/ecti-cit.201151.54230openalex-snapshot
Characteristic Sets for Learning k-Acceptable Languages
inferred← citeshttps://doi.org/10.5120/ijca2018916512openalex-snapshot
Learning Very Simple Matrix Grammar
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.