On the public citation graph

Apex graph grammars and attribute grammars

https://doi.org/10.1007/bf00279953
0 signed · 58 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-09118-1_15openalex-snapshot
On storage optimization for automatically generated compilers
inferredcites →https://doi.org/10.1007/3-540-18771-5_51openalex-snapshot
Restricting the complexity of regular DNLC languages
inferredcites →https://doi.org/10.1007/3-540-18771-5_52openalex-snapshot
Apex graph grammars
inferredcites →https://doi.org/10.1007/978-1-4615-2217-1_1openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_18openalex-snapshot
Rule Trees Represent Derivations in Edge Replacement Systems
inferredcites →https://doi.org/10.1007/bf00264495openalex-snapshot
A characterization of attribute evaluation in passes
inferredcites →https://doi.org/10.1007/bf00289115openalex-snapshot
Graph theoretic closure properties of the family of boundary NLC graph languages
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf00289591openalex-snapshot
A characterization of context-free string languages by directed node-label controlled graph grammars
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bfb0000105openalex-snapshot
Modelling compiler generation by graph grammars
inferredcites →https://doi.org/10.1007/bfb0000107openalex-snapshot
Graph grammars with node-label controlled rewriting and embedding
inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot
Graph-Grammars and Their Application to Computer Science and Biology
inferredcites →https://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
inferredcites →https://doi.org/10.1007/bfb0028825openalex-snapshot
Tree-partite graphs and the complexity of algorithms
inferredcites →https://doi.org/10.1016/0020-0190(84)90069-3openalex-snapshot
Note on node-rewriting graph grammars
inferredcites →https://doi.org/10.1016/0020-0255(80)90038-9openalex-snapshot
On the structure of node-label-controlled graph languages
inferredcites →https://doi.org/10.1016/0022-0000(81)90025-8openalex-snapshot
Decision problems for node label controlled graph grammars
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/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0146-664x(82)90036-3openalex-snapshot
On sequential and parallel node-rewriting graph grammars
inferredcites →https://doi.org/10.1016/0166-218x(85)90080-0openalex-snapshot
Traces, dependency graphs and DNLC grammars
inferredcites →https://doi.org/10.1016/0166-218x(86)90070-3openalex-snapshot
On the membership problem for regular DNLC grammars
inferredcites →https://doi.org/10.1016/0166-218x(87)90054-0openalex-snapshot
Combinatorial properties of boundary NLC graph languages
inferredcites →https://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/0304-3975(82)90088-3openalex-snapshot
Graph grammars with neighbourhood-controlled embedding
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
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(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
inferredcites →https://doi.org/10.1016/s0019-9958(79)90088-3openalex-snapshot
A mathematical investigation of propagating graph 0L systems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
inferredcites →https://doi.org/10.1137/0210060openalex-snapshot
Minimizing the Number of Evaluation Passes for Attribute Grammars
inferredcites →https://doi.org/10.1145/361227.361231openalex-snapshot
The intrinsically exponential complexity of the circularity problem for attribute grammars
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.2001.1749openalex-snapshot
Separation Results for Separated Apex NLC and NCE Graph Languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_70openalex-snapshot
A Greibach normal form for context-free graph grammars
inferred← citeshttps://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferred← citeshttps://doi.org/10.1007/bf01178511openalex-snapshot
Context-free graph languages of bounded degree are generated by apex graph grammars
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/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0035847openalex-snapshot
On polynomial time graph grammars
inferred← citeshttps://doi.org/10.1007/pl00013320openalex-snapshot
Efficient recognition algorithms for boundary and linear eNCE graph languages
inferred← citeshttps://doi.org/10.1007/s002360050087openalex-snapshot
A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions
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/0304-3975(89)90145-xopenalex-snapshot
An efficient algorithm to decide whether a monoid presented by a regular church-rosser thue system is a group
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot
Nonterminal separation in graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90290-aopenalex-snapshot
Separating k-separated eNCE graph languages
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
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.2004.09.040openalex-snapshot
Finite graph automata for linear and boundary graph languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.029openalex-snapshot
Quasi-rocking real-time pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.038openalex-snapshot
On the structure of linear apex NLC graph grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)86542-5openalex-snapshot
A hierarchy of eNCE families of graph languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00138-3openalex-snapshot
Double Greibach operator grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00258-3openalex-snapshot
HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting
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.