On the public citation graph

Context-free hypergraph grammars have the same term-generating power as attribute grammars

https://doi.org/10.1007/bf01178504
0 signed · 72 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-10250-7_25openalex-snapshot
On defining semantics by means of extended attribute grammars
inferredcites →https://doi.org/10.1007/3-540-10854-8_5openalex-snapshot
An algebraic definition of attributed transformations
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_55openalex-snapshot
Graph grammars and diagram editing
inferredcites →https://doi.org/10.1007/3-540-18771-5_69openalex-snapshot
An efficient algorithm for the solution of hierarchical networks of constraints
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-50667-5_71openalex-snapshot
Jungle evaluation for efficient term rewriting
inferredcites →https://doi.org/10.1007/3-540-53982-4_16openalex-snapshot
Logic programming as hypergraph Rewriting
inferredcites →https://doi.org/10.1007/3-540-54496-8_16openalex-snapshot
Extended ML: Past, present and future
inferredcites →https://doi.org/10.1007/978-3-642-72248-6_5openalex-snapshot
Attributed Tree Transducers
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/bf00264472openalex-snapshot
Interpretation and reduction of attribute grammars
inferredcites →https://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01744285openalex-snapshot
An order-algebraic definition of knuthian semantics
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0000105openalex-snapshot
Modelling compiler generation by graph grammars
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferredcites →https://doi.org/10.1007/bfb0022511openalex-snapshot
A mathematical approach to multi-pass parsing
inferredcites →https://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0022-0000(85)90066-2openalex-snapshot
Macro tree transducers
inferredcites →https://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
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(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/0743-1066(85)90015-9openalex-snapshot
Relating logic programs and attribute grammars
inferredcites →https://doi.org/10.1016/0890-5401(88)90002-8openalex-snapshot
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
inferredcites →https://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
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/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(77)90309-6openalex-snapshot
IO-macrolanguages and attributed translations
inferredcites →https://doi.org/10.1016/s0020-0255(71)80008-7openalex-snapshot
Plex languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80016-8openalex-snapshot
Pair grammars, graph languages and string-to-graph translations
inferredcites →https://doi.org/10.1137/0215005openalex-snapshot
The Complexity of Languages Generated by Attribute Grammars
inferredcites →https://doi.org/10.1145/359997.359999openalex-snapshot
Semantic evaluation from left to right

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.1998.2736openalex-snapshot
The Generating Power of Total Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferred← citeshttps://doi.org/10.1007/11841883_11openalex-snapshot
String Generating Hypergraph Grammars with Word Order Restrictions
inferred← citeshttps://doi.org/10.1007/3-540-29953-x_10openalex-snapshot
The Automata-Theoretic Approach
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/978-3-319-15579-1_51openalex-snapshot
Towards More Precise Rewriting Approximations
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_26openalex-snapshot
Tree Transducers and Tree Compressions
inferred← citeshttps://doi.org/10.1007/978-3-540-25959-6_12openalex-snapshot
Modeling Discontinuous Constituents with Hypergraph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_25openalex-snapshot
Parsing String Generating Hypergraph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph 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/bf01178667openalex-snapshot
Synthesized and inherited functions
inferred← citeshttps://doi.org/10.1007/s002240000115openalex-snapshot
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1016/j.ic.2015.04.005openalex-snapshot
The generative power of delegation networks
inferred← citeshttps://doi.org/10.1016/j.is.2018.03.002openalex-snapshot
Grammar-based graph compression
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.006openalex-snapshot
Towards more precise rewriting approximations
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot
The translation power of top-down tree-to-graph transducers
inferred← citeshttps://doi.org/10.1023/a:1009939414825openalex-snapshot
Cooperating Distributed Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1093/comjnl/bxae100openalex-snapshot
A comparison of reserved graph grammar and edge-based graph grammar
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.14232/actacyb.22.2.2015.9openalex-snapshot
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
inferred← citeshttps://doi.org/10.15398/jlm.v3i1.94openalex-snapshot
A logical approach to grammar description
inferred← citeshttps://doi.org/10.18653/v1/w16-24openalex-snapshot
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata
inferred← citeshttps://doi.org/10.18653/v1/w16-2407openalex-snapshot
EM-Training for Weighted Aligned Hypergraph Bimorphisms
inferred← citeshttps://doi.org/10.18725/oparu-1060openalex-snapshot
Synthesized and inherited functions - a new computational model for syntax-directed semantics
inferred← citeshttps://doi.org/10.4204/eptcs.310.1openalex-snapshot
Experience Report: Towards Moving Things with Types - Helping Logistics Domain Experts to Control Cyber-Physical Systems with Type-Based Synthesis
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.