On the public citation graph

A stochastic search approach to grammar induction

https://doi.org/10.1007/bfb0054070
0 signed · 23 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/bf00114845openalex-snapshot
The induction of dynamical recognizers
inferredcites →https://doi.org/10.1007/bfb0054059openalex-snapshot
Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm
inferredcites →https://doi.org/10.1016/s0019-9958(78)90562-4openalex-snapshot
Complexity of automaton identification from given data
inferredcites →https://doi.org/10.1137/0221022openalex-snapshot
Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
inferredcites →https://doi.org/10.1145/130385.130390openalex-snapshot
Random DFA's can be approximately learned from sparse uniform examples
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.1162/neco.1992.4.3.406openalex-snapshot
Induction of Finite-State Languages Using Second-Order Recurrent Networks
inferredcites →https://doi.org/10.1162/neco.1993.5.6.976openalex-snapshot
Learning Finite State Machines With Self-Clustering Recurrent Networks
inferredcites →https://doi.org/10.1162/neco.1995.7.5.923openalex-snapshot
Learning the Initial State of a Second-Order Recurrent Neural Network during Regular-Language Inference
inferredcites →https://doi.org/10.2307/2005469openalex-snapshot
Estimating the Efficiency of Backtrack Programs
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/11474.003.0014openalex-snapshot
Neural Information Processing Systems

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_3openalex-snapshot
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_4openalex-snapshot
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
inferred← citeshttps://doi.org/10.1007/978-3-642-36089-3_12openalex-snapshot
Grammatical Inference in Software Engineering: An Overview of the State of the Art
inferred← citeshttps://doi.org/10.1007/s00236-020-00365-8openalex-snapshot
Minimal consistent DFA from sample strings
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.027openalex-snapshot
Inference of regular languages using state merging algorithms with search
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.1023/a:1010828029885openalex-snapshot
Efficient Algorithms for the Inference of Minimum Size DFAs
inferred← citeshttps://doi.org/10.1115/1.4007153openalex-snapshot
A Stochastic Tree-Search Algorithm for Generative Grammars1
inferred← citeshttps://doi.org/10.1162/153244304773936063openalex-snapshot
10.1162/153244304773936063
inferred← citeshttps://doi.org/10.17345/triangle8.121-136openalex-snapshot
A Survey of State Merging Strategies for DFA Identification in the Limit
inferred← citeshttps://doi.org/10.70675/ad0099a8ze085z4ef0z8aabz173dfd32d8d6openalex-snapshot
Un mécanisme constructiviste d'apprentissage automatique, d'anticipations pour des agents artificiels situés
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.