On the public citation graph

An incremental interactive algorithm for regular grammar inference

https://doi.org/10.1007/bfb0033358
0 signed · 34 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-58473-0_134openalex-snapshot
What is the search space of the regular inference?
inferredcites →https://doi.org/10.1007/978-1-4613-1557-5openalex-snapshot
Incremental Version-Space Merging: A General Framework for Concept Learning
inferredcites →https://doi.org/10.1007/978-3-642-83462-2_10openalex-snapshot
Learning From Examples in Sequences and Grammatical Inference
inferredcites →https://doi.org/10.1007/bf00058754openalex-snapshot
A Version Space Approach to Learning Context-free Grammars
inferredcites →https://doi.org/10.1007/bf00114841openalex-snapshot
Learning automata from ordered examples
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
inferredcites →https://doi.org/10.1016/0096-0551(78)90006-1openalex-snapshot
A solution of the syntactical induction-inference problem for regular languages
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/b978-0-12-737140-5.50007-5openalex-snapshot
A SURVEY OF RESULTS IN GRAMMATICAL INFERENCE
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.1109/ijcnn.1991.155350openalex-snapshot
Second-order recurrent neural networks for grammatical inference
inferredcites →https://doi.org/10.2307/1573270openalex-snapshot
Frontiers of Pattern Recognition

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45790-9_14openalex-snapshot
Incremental Learning of Context Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-67187-7_14openalex-snapshot
Grammar Based Computing: A New Paradigm for Solving Real Life Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_15openalex-snapshot
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_13openalex-snapshot
LearnPADS + + : Incremental Inference of Ad Hoc Data Formats
inferred← citeshttps://doi.org/10.1007/bfb0054062openalex-snapshot
A polynomial time incremental algorithm for learning DFA
inferred← citeshttps://doi.org/10.1007/s10618-007-0065-yopenalex-snapshot
Mining process models with non-free-choice constructs
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.004openalex-snapshot
Incremental learning of context free grammars based on bottom-up parsing and search
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678525openalex-snapshot
Learning Patterns in Configuration
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681964openalex-snapshot
Alignment Based Similarity Measure for Grammar Learning
inferred← citeshttps://doi.org/10.1109/icetet.2009.162openalex-snapshot
On the Inference of Context-Free Grammars Based On Bottom-Up Parsing and Search
inferred← citeshttps://doi.org/10.1109/icse.2013.6606696openalex-snapshot
Example-Driven Modeling: Model = Abstractions + Examples
inferred← citeshttps://doi.org/10.1145/1138912.1138919openalex-snapshot
Inferring state-based behavior models
inferred← citeshttps://doi.org/10.1145/1368088.1368157openalex-snapshot
Automatic generation of software behavioral models
inferred← citeshttps://doi.org/10.1145/1620432.1620434openalex-snapshot
Efficient discovery of join plans in schemaless data
inferred← citeshttps://doi.org/10.1145/2993236.2993244openalex-snapshot
Synthesizing regular expressions from examples for introductory automata assignments
inferred← citeshttps://doi.org/10.1145/3379337.3415900openalex-snapshot
Interactive Program Synthesis by Augmented Examples
inferred← citeshttps://doi.org/10.1145/3411764.3445646openalex-snapshot
Interpretable Program Synthesis
inferred← citeshttps://doi.org/10.26438/ijcse/v6i1.108113openalex-snapshot
Approaches for Efficient Learning Software Models A Survey
inferred← citeshttps://doi.org/10.31274/rtd-180813-4981openalex-snapshot
Constructive learning: inducing grammars and neural networks
inferred← citeshttps://doi.org/10.32657/10356/13589openalex-snapshot
Refining learning models in grammatical inference
inferred← citeshttps://doi.org/10.5555/2486788.2486982openalex-snapshot
Example-driven modeling: model = abstractions + examples
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.