On the public citation graph

Graph grammars with node-label controlled rewriting and embedding

0 signed · 47 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-07854-1_188openalex-snapshot

Parallelism of manipulations in multidimensional information structures

inferredcites →https://doi.org/10.1007/978-3-663-01443-0openalex-snapshot

Graph-Grammatiken

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/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)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/0146-664x(82)90036-3openalex-snapshot

On sequential and parallel node-rewriting graph grammars

inferredcites →https://doi.org/10.1016/0304-3975(82)90088-3openalex-snapshot

Graph grammars with neighbourhood-controlled embedding

inferredcites →https://doi.org/10.1080/03081077608934737openalex-snapshot

PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†

inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot

The Mathematical Theory of L 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.1996.0090openalex-snapshot

Symbol–Relation Grammars: A Formalism for Graphical Languages

inferred← citeshttps://doi.org/10.1007/3-540-18771-5_59openalex-snapshot

Basic notions of actor grammars

inferred← citeshttps://doi.org/10.1007/3-540-18771-5_60openalex-snapshot

Embedding rule independent theory of graph grammars

inferred← citeshttps://doi.org/10.1007/3-540-19027-9_13openalex-snapshot

Garp: Graph abstractions for concurrent programming

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_77openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/978-3-540-75987-4_12openalex-snapshot

Querying Structural and Behavioral Properties of Business Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_8openalex-snapshot

Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation

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

Apex graph grammars and attribute grammars

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

Graph theoretic closure properties of the family of boundary NLC graph languages

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

Grammatical approaches to engineering design, part I: An introduction and commentary

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

Programming with very large graphs

inferred← citeshttps://doi.org/10.1007/s10472-009-9141-xopenalex-snapshot

Graphical reasoning in compact closed categories for quantum computation

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(90)90179-lopenalex-snapshot

Results on NLC grammars with one-letter terminal alphabets

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.jcss.2011.09.004openalex-snapshot

A structural/temporal query language for Business Processes

inferred← citeshttps://doi.org/10.1016/j.patcog.2010.01.004openalex-snapshot

On the use of graph parsing for recognition of isolated hand postures of Polish Sign Language

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.1016/s1571-0661(05)80176-8openalex-snapshot

Parallel Rewriting of Graphs through the Pullback Approach

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

Pullback as a Generic Graph Rewriting Mechanism

inferred← citeshttps://doi.org/10.1049/iet-sen.2010.0081openalex-snapshot

Improving the graph grammar parser of Rekers and Schurr

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

Parsing nonlinear languages

inferred← citeshttps://doi.org/10.1109/bic-ta.2011.2openalex-snapshot

Parallel Communicating Graph Grammar

inferred← citeshttps://doi.org/10.1109/wvl.1991.238844openalex-snapshot

Efficient parsing of multidimensional structures

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

A quest for beauty and wealth (or, business processes for database researchers)

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

Specifying concurrent systems with Δ-grammars

inferred← citeshttps://doi.org/10.1184/r1/6489875openalex-snapshot

Grammatical approaches to design

inferred← citeshttps://doi.org/10.14778/1453856.1453898openalex-snapshot

Type inference and type checking for queries on execution traces

inferred← citeshttps://doi.org/10.14778/1454159.1454244openalex-snapshot

Querying web-based applications under models of uncertainty

inferred← citeshttps://doi.org/10.3233/fun-2007-80403openalex-snapshot

Inference of Parsable Graph Grammars for Syntactic Pattern Recognition

inferred← citeshttps://doi.org/10.7494/cmms.2007.3.0176openalex-snapshot

On the support uml diagrams understanding during the software maintenance

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.