On the public citation graph

Some structural aspects of hypergraph languages generated by hyperedge replacement

https://doi.org/10.1007/bfb0039608
0 signed · 126 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-10291-4_13openalex-snapshot
Schema hypergraphs:A formalism to investigate logical data base design
inferredcites →https://doi.org/10.1007/3-540-15198-2_18openalex-snapshot
Decompilation of control structures by means of graph transformations
inferredcites →https://doi.org/10.1007/978-3-319-68705-6openalex-snapshot
Graph-Theoretic Concepts in Computer Science
inferredcites →https://doi.org/10.1007/978-3-642-68353-4_23openalex-snapshot
Stepwise Refinements of Transitions and Places
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0000097openalex-snapshot
Graph grammars for distributed systems
inferredcites →https://doi.org/10.1007/bfb0000104openalex-snapshot
On context-free graph languages generated by edge replacement
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.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferredcites →https://doi.org/10.1007/bfb0025726openalex-snapshot
A pumping lemma for context-free graph languages
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(79)90050-3openalex-snapshot
Analysis of petri nets by stepwise refinements
inferredcites →https://doi.org/10.1016/s0020-0255(71)80008-7openalex-snapshot
Plex languages
inferredcites →https://doi.org/10.1016/s0022-0000(75)80067-5openalex-snapshot
Dynamics of discrete systems and pattern reproduction
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1109/sfcs.1976.17openalex-snapshot
Graph grammars and global program data flow analysis
inferredcites →https://doi.org/10.1145/321679.321682openalex-snapshot
Linear and Context-Free Graph Grammars
inferredcites →https://doi.org/10.3233/fi-1986-9103openalex-snapshot
Concurrent Transformations of Relational Structures

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.1997.1515openalex-snapshot
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems
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.2001.1749openalex-snapshot
Separation Results for Separated Apex NLC and NCE Graph Languages
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_51openalex-snapshot
Behaviour preserving refinements of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_6openalex-snapshot
Combinatorial hypermap rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_69openalex-snapshot
An efficient algorithm for the solution of hierarchical networks of constraints
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_78openalex-snapshot
Boundary NLC and partition controlled graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_3openalex-snapshot
Pretty patterns produced by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_35openalex-snapshot
On systems of equations defining infinite graphs
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_8openalex-snapshot
Filtering hyperedge-replacement languages through compatible properties
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_42openalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_89openalex-snapshot
Recursively indefinite databases
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_51openalex-snapshot
On the transition graphs of automata and grammars
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/3-540-56610-4_63openalex-snapshot
Hyperedge replacement with rendezvous
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_5openalex-snapshot
Five facets of hyperedge replacement beyond context-freeness
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_20openalex-snapshot
Set-theoretic graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_100openalex-snapshot
HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
inferred← citeshttps://doi.org/10.1007/978-3-030-50420-5_9openalex-snapshot
Hypergraph Grammar-Based Model of Adaptive Bitmap Compression
inferred← citeshttps://doi.org/10.1007/978-3-031-97554-7_16openalex-snapshot
Graph Grammar Model for H-Adaptation for Meshes with Quadrilateral, Pentagon, and Hexagon Elements
inferred← citeshttps://doi.org/10.1007/978-3-032-29912-3_11openalex-snapshot
Graph Grammar Model for Mesh Refinements for High-Order Polygonal Discontinuous Petrov-Galerkin Method
inferred← citeshttps://doi.org/10.1007/978-3-319-19369-4_68openalex-snapshot
Using Co-occurring Graph Patterns in Computer Aided Design Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-39384-1_40openalex-snapshot
On Cooperation in Multi-agent System, Based on Heterogeneous Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6_4openalex-snapshot
A Simple Notion of Parallel Graph Transformation and Its Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-642-20320-6_51openalex-snapshot
Using Graph Mining Approach to Automatic Reasoning in Design Support Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21219-2_36openalex-snapshot
Genetic Selection of Subgraphs for Automatic Reasoning in Design Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-23169-8_29openalex-snapshot
Graph Similarity Measure in Automatic Evaluation of Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_31openalex-snapshot
Distributional Learning of Simple Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-31262-5_8openalex-snapshot
CoTAGs and ACGs
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_17openalex-snapshot
Parallel Hyperedge Replacement
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_22openalex-snapshot
Reading Words in Graphs Generated by Hyperedge Replacement
inferred← citeshttps://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
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/bf01204169openalex-snapshot
A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars
inferred← citeshttps://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferred← citeshttps://doi.org/10.1007/bfb0017373openalex-snapshot
A note on hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017385openalex-snapshot
General solution to a system of recursive equations on hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0017390openalex-snapshot
An application of graph grammars to the elimination of redundancy from functions defined by schemes
inferred← citeshttps://doi.org/10.1007/bfb0017394openalex-snapshot
Context-free handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017406openalex-snapshot
Grammatical inference based on hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017421openalex-snapshot
Recognizing edge replacement graph languages in cubic time
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
inferred← citeshttps://doi.org/10.1007/bfb0035848openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC 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/s00366-020-01253-yopenalex-snapshot
Parallel graph-grammar-based algorithm for the longest-edge refinement of triangular meshes and the pollution simulations in Lesser Poland area
inferred← citeshttps://doi.org/10.1007/s10849-009-9109-6openalex-snapshot
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1016/0004-3702(91)90059-sopenalex-snapshot
Constraint relaxation may be perfect
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90106-xopenalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90222-nopenalex-snapshot
Infinite hypergraphs I. Basic properties
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90353-4openalex-snapshot
Modular tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90065-2openalex-snapshot
Recognising k-connected hypergraphs in cubic time
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90223-gopenalex-snapshot
Recursively indefinite databases
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90290-aopenalex-snapshot
Separating k-separated eNCE graph languages
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90354-vopenalex-snapshot
A comparison of compatible, finite, and inductive graph properties
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/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferred← citeshttps://doi.org/10.1016/j.aei.2009.06.007openalex-snapshot
Reasoning about designs through frequent patterns mining
inferred← citeshttps://doi.org/10.1016/j.aei.2012.10.002openalex-snapshot
Supporting communication and cooperation in distributed representation for adaptive design
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.043openalex-snapshot
Heterogeneous graph grammars synchronization in CAD systems supported by hypergraph representations of buildings
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104774openalex-snapshot
Weighted parsing for grammar-based language models over multioperator monoids
inferred← citeshttps://doi.org/10.1016/j.jocs.2022.101856openalex-snapshot
Graph-grammar based algorithm for asteroid tsunami simulations
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.322openalex-snapshot
Hypergraph Grammars in hp-adaptive Finite Element Method
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.090openalex-snapshot
Hypergraph Grammar based Adaptive Linear Computational Cost Projection Solvers for Two and Three Dimensional Modeling of Brain
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.097openalex-snapshot
Hypergraph Grammar based Linear Computational Cost Solver for Three Dimensional Grids with Point Singularities
inferred← citeshttps://doi.org/10.1016/j.procs.2016.05.314openalex-snapshot
Hypergraph Grammars in Non-stationary hp- adaptive Finite Element Method
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.1016/s0304-3975(97)00190-4openalex-snapshot
Independent parallelism in finite copying parallel rewriting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00258-3openalex-snapshot
HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting
inferred← citeshttps://doi.org/10.1017/s0890060408000097openalex-snapshot
A grammar-based multiagent system in dynamic design
inferred← citeshttps://doi.org/10.1109/iiai-aai.2014.51openalex-snapshot
Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.1142/s0129054107005315openalex-snapshot
CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS
inferred← citeshttps://doi.org/10.1155/2015/303024openalex-snapshot
Quasi-Optimal Elimination Trees for 2D Grids with Singularities
inferred← citeshttps://doi.org/10.1162/coli_a_00488openalex-snapshot
Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies
inferred← citeshttps://doi.org/10.14232/phd.11681openalex-snapshot
Weighted Tree Generating Regular Systems and Crisp-Determinization of Weighted Tree Automata
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4b.129openalex-snapshot
Projektowanie wizualne z wykorzystaniem hierarchicznych hipergrafów
inferred← citeshttps://doi.org/10.2478/amcs-2018-0044openalex-snapshot
Applications of A Hyper–Graph Grammar System in Adaptive Finite–Element Computations
inferred← citeshttps://doi.org/10.29354/diag/144154openalex-snapshot
Directed hypergraph observers-based qualitative fault monitoring tasks
inferred← citeshttps://doi.org/10.3115/981967.981985openalex-snapshot
Linear context-free rewriting systems and deterministic tree-walking transducers
inferred← citeshttps://doi.org/10.4028/www.scientific.net/kem.486.217openalex-snapshot
Multi-Agent System for Distributed Adaptive Design
inferred← citeshttps://doi.org/10.4028/www.scientific.net/kem.572.315openalex-snapshot
Transactional Model of Graph Transformations in Computer Aided Design
inferred← citeshttps://doi.org/10.4204/eptcs.181.2openalex-snapshot
!-Graphs with Trivial Overlap are Context-Free
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05014openalex-snapshot
Hypergraphs: an introduction and review
inferred← citeshttps://doi.org/10.48550/arxiv.2105.02033openalex-snapshot
Polynomial Graph Parsing with Non-Structural Reentrancies
inferred← citeshttps://doi.org/10.7494/csci.2015.16.1.75openalex-snapshot
HYPERGRAMMAR-BASED PARALLEL MULTI-FRONTAL SOLVER FOR GRIDS WITH POINT SINGULARITIES
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.