On the public citation graph

A characterization of context-free string languages by directed node-label controlled graph grammars

https://doi.org/10.1007/bf00289591
0 signed · 35 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/978-3-663-01443-0openalex-snapshot
Graph-Grammatiken
inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot
Graph-Grammars and Their Application to Computer Science and Biology
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1016/0020-0255(80)90039-0openalex-snapshot
Restrictions, extensions, and variations of NLC grammars
inferredcites →https://doi.org/10.1145/322217.322222openalex-snapshot
The Sequence Equivalence Problem is Decidable for 0S Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1029openalex-snapshot
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_44openalex-snapshot
An introduction to the NLC way of rewriting graphs
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_46openalex-snapshot
Graph grammar based specification of interconnection structures for massively parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_48openalex-snapshot
On partially ordered graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_51openalex-snapshot
Restricting the complexity of regular DNLC languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_11openalex-snapshot
On the Structure of Dependence Graphs
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bfb0000107openalex-snapshot
Graph grammars with node-label controlled rewriting and embedding
inferred← citeshttps://doi.org/10.1007/bfb0017374openalex-snapshot
Graph grammars based on node rewriting: an introduction to NLC graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0035847openalex-snapshot
On polynomial time graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0036472openalex-snapshot
The computational complexity of certain graph grammars
inferred← citeshttps://doi.org/10.1016/0020-0255(90)90042-9openalex-snapshot
On structured graph grammars. I
inferred← citeshttps://doi.org/10.1016/0020-0255(90)90044-bopenalex-snapshot
On structured graph grammars. II
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90060-7openalex-snapshot
The bounded degree problem for NLC grammars is decidable
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90012-2openalex-snapshot
Handle NLC grammars and R. E. languages
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90002-3openalex-snapshot
Boundary graph grammars with dynamic edge relabeling
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90004-5openalex-snapshot
The complexity of regular DNLC graph languages
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90080-0openalex-snapshot
Traces, dependency graphs and DNLC grammars
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90070-3openalex-snapshot
On the membership problem for regular DNLC grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90135-xopenalex-snapshot
Restrictions on NLC graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90179-lopenalex-snapshot
Results on NLC grammars with one-letter terminal alphabets
inferred← citeshttps://doi.org/10.1016/0734-189x(83)90028-2openalex-snapshot
On sequential and parallel node-rewriting graph grammars, II
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.04.001openalex-snapshot
Graph grammars according to the type of input and manipulated data: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1109/igic.2013.6659163openalex-snapshot
Digital game playing as storyboard interpretation
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.