On the public citation graph
A class of linearly parsable graph grammars
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/zamm.19530331013openalex-snapshot
H. Rutishauser, Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen. (Mitteilungen aus dem Institut für angewandte Mathematik an der ETH. Zürich Nr. 3.) 45 S. m. 8 Abb. und 3 Strukturdiagrammen. Basel 1952. Verlag Birkhäuser. Preis brosch. 5,70 Schw. Fr
inferredcites →https://doi.org/10.1007/3-540-08342-1_16openalex-snapshot
The mathematics of record handling
inferredcites →https://doi.org/10.1007/978-3-642-48895-5_23openalex-snapshot
Categorical Approach to Graphic Systems and Graph Grammars
inferredcites →https://doi.org/10.1007/978-3-642-93048-5_8openalex-snapshot
Graph Rewriting Systems and their Application in Biology
inferredcites →https://doi.org/10.1007/978-3-662-40087-6_16openalex-snapshot
PLAND2D — Towards a Two-Dimensional Programming Language
inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot
Deriving graphs from graphs by applying a production
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.1109/sfcs.1976.17openalex-snapshot
Graph grammars and global program data flow analysis
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.1145/800168.811547openalex-snapshot
PLAN2D - syntactic analysis of precedence graph grammars
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_47openalex-snapshot
Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity
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_43openalex-snapshot
Set theoretic approaches to graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_62openalex-snapshot
Practical applications of precedence graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_10openalex-snapshot
A parser for context free plex grammars
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_2openalex-snapshot
A Survey of Visual Language Specification and Recognition
inferred← citeshttps://doi.org/10.1007/978-3-319-11331-9_24openalex-snapshot
Characteristics of Bottom-Up Parsable edNLC Graph Languages for Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-319-21145-9_2openalex-snapshot
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-50230-4_9openalex-snapshot
Approximating Parikh Images for Generating Deterministic Graph Parsers
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_7openalex-snapshot
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-74730-9_7openalex-snapshot
Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-32172-6_16openalex-snapshot
An Attribute Labeled Grid Graph Grammar and Its Application to Program Specification Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-48675-3_6openalex-snapshot
Statistical and Syntactic Models and Pattern Recognition Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_14openalex-snapshot
Strukturerkennung mit Graphgrammatiken
inferred← citeshttps://doi.org/10.1007/978-3-642-77281-8_24openalex-snapshot
Syntactic Analysis of Context—Free Plex Languages for Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-77449-2_3openalex-snapshot
From Parallel to Distributed Derivations of Graphs in the Single-Pushout-Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-83462-2_5openalex-snapshot
Computing the Minimum Error Distance of Graphs in 0(n3) Time with Precedence Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-94-009-4464-0_2openalex-snapshot
Syntactics. Its Relation To Morphology and Syntax, To Semantics and Pragmatics, and To Syntagmatics and Paradigmatics
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bf01578996openalex-snapshot
Compound feature recognition by web grammar parsing
inferred← citeshttps://doi.org/10.1007/bfb0000106openalex-snapshot
Hypergraph systems generating graph languages
inferred← citeshttps://doi.org/10.1007/bfb0022515openalex-snapshot
Node-label controlled graph grammars (Extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0025726openalex-snapshot
A pumping lemma for context-free graph languages
inferred← citeshttps://doi.org/10.1016/0031-3203(93)90083-9openalex-snapshot
On the parsing of deterministic graph languages for syntactic pattern recognition
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90051-5openalex-snapshot
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.12.006openalex-snapshot
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
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/s1571-0661(04)00180-xopenalex-snapshot
Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms
inferred← citeshttps://doi.org/10.1109/snpd.2015.7176260openalex-snapshot
A formalization of financial statements with heterogeneous parts by graph grammars
inferred← citeshttps://doi.org/10.1109/tpami.1983.4767426openalex-snapshot
Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
inferred← citeshttps://doi.org/10.1109/vl.1994.363611openalex-snapshot
A predictive parser for visual languages specified by relation grammars
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.401openalex-snapshot
Visual Software Development Environment Based on Graph Grammars
inferred← citeshttps://doi.org/10.2197/ipsjjip.20.622openalex-snapshot
Automatic Generation of XML Files and Their Database Registration from Tabular Form Specifications
inferred← citeshttps://doi.org/10.26083/tuprints-00003352openalex-snapshot
Incremental Model Synchronization with Precedence-Driven Triple Graph Grammars
inferred← citeshttps://doi.org/10.3233/fun-2007-80403openalex-snapshot
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
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.