On the public citation graph

Grammatical inference based on hyperedge replacement

https://doi.org/10.1007/bfb0017406
0 signed · 40 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-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferredcites →https://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-52292-1_8openalex-snapshot
Filtering hyperedge-replacement languages through compatible properties
inferredcites →https://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf02459961openalex-snapshot
Inference algorithms for developmental systems with cell lineages
inferredcites →https://doi.org/10.1007/bfb0000095openalex-snapshot
Grammatical inference of graph grammars for syntactic pattern recognition
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0020-0190(88)90208-6openalex-snapshot
Grammatical inference for even linear languages based on control sets
inferredcites →https://doi.org/10.1016/0020-0255(76)90061-xopenalex-snapshot
Grammatical inference by Hill Climbing
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1109/proc.1983.12755openalex-snapshot
Syntactic pattern recognition and applications
inferredcites →https://doi.org/10.1109/tsmc.1975.5409159openalex-snapshot
Grammatical Inference: Introduction and Survey - Part I
inferredcites →https://doi.org/10.5075/epfl-thesis-305openalex-snapshot
Syntactic pattern recognition : a general system for description of handprinted text written on a graphic tablet

What points at this work

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

inferred← citeshttps://doi.org/10.1002/widm.1372openalex-snapshot
A survey of pattern mining in dynamic graphs
inferred← citeshttps://doi.org/10.1007/11768869_13openalex-snapshot
Generating Instance Models from Meta Models
inferred← citeshttps://doi.org/10.1007/3-540-44522-6_14openalex-snapshot
Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_5openalex-snapshot
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-40530-8_13openalex-snapshot
Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_19openalex-snapshot
Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-34176-2_12openalex-snapshot
Graph Grammar Induction as a Parser-Controlled Heuristic Search Process
inferred← citeshttps://doi.org/10.1007/bf00962235openalex-snapshot
Knowledge discovery from structural data
inferred← citeshttps://doi.org/10.1007/s10270-008-0095-yopenalex-snapshot
Generating instance models from meta models
inferred← citeshttps://doi.org/10.1016/bs.adcom.2019.07.003openalex-snapshot
Graph grammar induction
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.006openalex-snapshot
Learning an efficient constructive sampler for graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.002openalex-snapshot
Grammatical inference of directed acyclic graph languages with polynomial time complexity
inferred← citeshttps://doi.org/10.1080/09540090110072327openalex-snapshot
Connectionist learning of regular graph grammars
inferred← citeshttps://doi.org/10.1109/icdm.2008.106openalex-snapshot
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data
inferred← citeshttps://doi.org/10.1137/1.9781611972764.57openalex-snapshot
Inference of Node Replacement Recursive Graph Grammars
inferred← citeshttps://doi.org/10.1137/1.9781611972801.43openalex-snapshot
Inferring Probability Distributions of Graph Size and Node Degree from Stochastic Graph Grammars
inferred← citeshttps://doi.org/10.1142/s0218213004001429openalex-snapshot
MDL-BASED CONTEXT-FREE GRAPH GRAMMAR INDUCTION AND APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218213008004047openalex-snapshot
INFERENCE OF EDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2792openalex-snapshot
GTRACE: Mining Frequent Subsequences from Graph Sequences
inferred← citeshttps://doi.org/10.1613/jair.43openalex-snapshot
Substructure Discovery Using Minimum Description Length and Background Knowledge
inferred← citeshttps://doi.org/10.2478/v10006-008-0022-yopenalex-snapshot
Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
inferred← citeshttps://doi.org/10.3233/fi-2016-1393openalex-snapshot
Designing and Learning Substitutable Plane Graph Grammars
inferred← citeshttps://doi.org/10.3233/ida-2007-11405openalex-snapshot
Inference of node replacement graph grammars
inferred← citeshttps://doi.org/10.4067/s0718-33052007000100012openalex-snapshot
UNA VISUALIZACIÓN DE UN SISTEMA DE INFERENCIA A TRAVÉS DE TREEBAG
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.