On the public citation graph

Graph grammars based on node rewriting: an introduction to NLC graph grammars

0 signed · 85 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_48openalex-snapshot

On partially ordered graph grammars

inferredcites →https://doi.org/10.1007/3-540-18771-5_60openalex-snapshot

Embedding rule independent theory of graph grammars

inferredcites →https://doi.org/10.1007/3-540-18771-5_62openalex-snapshot

Practical applications of precedence graph grammars

inferredcites →https://doi.org/10.1007/3-540-18771-5_78openalex-snapshot

Boundary NLC and partition controlled graph grammars

inferredcites →https://doi.org/10.1007/3-540-51498-8_15openalex-snapshot

Context-free NCE graph grammars

inferredcites →https://doi.org/10.1007/3-540-52292-1_6openalex-snapshot

On hyperedge replacement and BNLC graph grammars

inferredcites →https://doi.org/10.1007/978-3-642-95486-3_38openalex-snapshot

On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language

inferredcites →https://doi.org/10.1007/bf00279953openalex-snapshot

Apex graph grammars and attribute grammars

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/bf00289591openalex-snapshot

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

inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot

Graph-Grammars and Their Application to Computer Science

inferredcites →https://doi.org/10.1007/bfb0017394openalex-snapshot

Context-free handle-rewriting hypergraph grammars

inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot

A characterization of context-free NCE graph languages by monadic second-order logic on trees

inferredcites →https://doi.org/10.1007/bfb0035847openalex-snapshot

On polynomial time graph grammars

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/0020-0255(80)90039-0openalex-snapshot

Restrictions, extensions, and variations of NLC grammars

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/0022-0000(86)90060-7openalex-snapshot

The bounded degree problem for NLC grammars is decidable

inferredcites →https://doi.org/10.1016/0022-0000(87)90012-2openalex-snapshot

Handle NLC grammars and R. E. languages

inferredcites →https://doi.org/10.1016/0022-0000(90)90002-3openalex-snapshot

Boundary graph grammars with dynamic edge relabeling

inferredcites →https://doi.org/10.1016/0022-0000(90)90004-5openalex-snapshot

The complexity of regular DNLC graph languages

inferredcites →https://doi.org/10.1016/0022-0000(90)90012-aopenalex-snapshot

Edge-label controlled graph grammars

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)90088-3openalex-snapshot

Graph grammars with neighbourhood-controlled embedding

inferredcites →https://doi.org/10.1016/0304-3975(84)90135-xopenalex-snapshot

Restrictions on NLC graph 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/0304-3975(88)90148-xopenalex-snapshot

Nonterminal bounded NLC graph grammars

inferredcites →https://doi.org/10.1016/0304-3975(90)90179-lopenalex-snapshot

Results on NLC grammars with one-letter terminal alphabets

inferredcites →https://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot

Nonterminal separation in graph grammars

inferredcites →https://doi.org/10.1016/0734-189x(86)90023-xopenalex-snapshot

Neighborhood-uniform NLC grammars

inferredcites →https://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot

Linear graph grammars: Power and complexity

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/s0019-9958(86)80045-6openalex-snapshot

Boundary NLC graph grammars—Basic definitions, normal forms, and complexity

inferredcites →https://doi.org/10.1051/ita/1990240302671openalex-snapshot

Complexity of boundary graph languages

inferredcites →https://doi.org/10.5604/16431243.1036763openalex-snapshot

Patrząc na obraz Adama Chmielowskiego Zawale

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.1996.0013openalex-snapshot

Finite Languages for the Representation of Finite Graphs

inferred← citeshttps://doi.org/10.1007/3-540-55251-0_7openalex-snapshot

Monadic second-order definable graph transductions

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-56868-9_36openalex-snapshot

Agg — An implementation of algebraic graph rewriting

inferred← citeshttps://doi.org/10.1007/3-540-57163-9_14openalex-snapshot

Context-free graph grammars: Separating vertex replacement from hyperedge replacement

inferred← citeshttps://doi.org/10.1007/3-540-58094-8_25openalex-snapshot

Recent methods for RNA modeling using stochastic context-free grammars

inferred← citeshttps://doi.org/10.1007/3-540-58131-6_40openalex-snapshot

Dynamic labeled 2-structures with variable domains

inferred← citeshttps://doi.org/10.1007/3-540-60618-1_69openalex-snapshot

A uniform approach to graph rewriting: The pullback approach

inferred← citeshttps://doi.org/10.1007/3-540-61228-9_101openalex-snapshot

Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence

inferred← citeshttps://doi.org/10.1007/3-540-61228-9_103openalex-snapshot

Transformations of graph grammars

inferred← citeshttps://doi.org/10.1007/3-540-61228-9_77openalex-snapshot

A category-theoretical approach to vertex replacement: The generation of infinite graphs

inferred← citeshttps://doi.org/10.1007/3-540-62559-3_4openalex-snapshot

Node rewriting in hypergraphs

inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_12openalex-snapshot

Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars

inferred← citeshttps://doi.org/10.1007/978-981-97-6957-5_6openalex-snapshot

An Insight Into 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/bf01204169openalex-snapshot

A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars

inferred← citeshttps://doi.org/10.1007/bfb0019921openalex-snapshot

A modular design strategy for a flexible graphical database design environment: An experimental study

inferred← citeshttps://doi.org/10.1016/0168-0072(95)94698-vopenalex-snapshot

The monadic second-order logic of graphs VIII: Orientations

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90268-2openalex-snapshot

Monadic second-order definable graph transductions: 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.12.019openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00200-0openalex-snapshot

Node rewriting in graphs and hypergraphs: a categorical framework

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00212-0openalex-snapshot

Power properties of NLC graph grammars with a polynomial membership problem

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot

Generating irregular partitionable data structures

inferred← citeshttps://doi.org/10.1017/s0960129500000554openalex-snapshot

Dynamic labeled 2-structures

inferred← citeshttps://doi.org/10.1023/a:1008610714027openalex-snapshot

Pullback as a Generic Graph Rewriting Mechanism

inferred← citeshttps://doi.org/10.1080/09540090110072327openalex-snapshot

Connectionist learning of regular graph grammars

inferred← citeshttps://doi.org/10.1093/logcom/exr046openalex-snapshot

On the inference of non-confluent NLC graph grammars

inferred← citeshttps://doi.org/10.1109/hicss.1994.323568openalex-snapshot

Stochastic context-free grammars for modeling RNA

inferred← citeshttps://doi.org/10.1109/icde.1995.380405openalex-snapshot

The AQUA approach to querying lists and trees in object-oriented databases

inferred← citeshttps://doi.org/10.1109/iceccs54210.2022.00030openalex-snapshot

DLGR: A Rule-Based Approach to Graph Replacement for Deep Learning

inferred← citeshttps://doi.org/10.1109/igic.2013.6659163openalex-snapshot

Digital game playing as storyboard interpretation

inferred← citeshttps://doi.org/10.1109/lics.1993.287589openalex-snapshot

Monadic second-order logic and hypergraph orientation

inferred← citeshttps://doi.org/10.1109/vl.1993.269604openalex-snapshot

A framework for formally defining the syntax of visual languages

inferred← citeshttps://doi.org/10.1142/s0218213004001429openalex-snapshot

MDL-BASED CONTEXT-FREE GRAPH GRAMMAR INDUCTION AND APPLICATIONS

inferred← citeshttps://doi.org/10.1145/1835804.1835822openalex-snapshot

Diagnosing memory leaks using graph mining on heap dumps

inferred← citeshttps://doi.org/10.1145/1859799.1859816openalex-snapshot

Graph grammar representation for collaborative sample-based music creation

inferred← citeshttps://doi.org/10.1145/2948628.2948635openalex-snapshot

Learning geometric graph grammars

inferred← citeshttps://doi.org/10.22260/isarc2015/0006openalex-snapshot

Automatic Detailing of Parametric Sketches by Graph Transformation

inferred← citeshttps://doi.org/10.3233/fi-1996-27101openalex-snapshot

EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY

inferred← citeshttps://doi.org/10.4018/978-1-4666-2497-9.ch006openalex-snapshot

Representing Music as Work in Progress

inferred← citeshttps://doi.org/10.4018/978-1-4666-6042-7.ch057openalex-snapshot

Representing Music as Work in Progress

inferred← citeshttps://doi.org/10.4018/978-1-61520-629-2.ch011openalex-snapshot

On the Efficient Dynamical Financial Analysis Computation Supported by UML(VR)

inferred← citeshttps://doi.org/10.48550/arxiv.0901.4876openalex-snapshot

Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs

inferred← citeshttps://doi.org/10.70675/1e1ddf12z0eacz4bccza3cez81dbecc19375openalex-snapshot

Adaptation d'ontologies avec les grammaires de graphes typés : évolution et fusion

inferred← citeshttps://doi.org/10.7551/mitpress/8291.003.0026openalex-snapshot

Adaptive Computation and Machine Learning

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.