On the public citation graph
On polynomial time graph grammars
0 signed · 63 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.1007/3-540-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferredcites →https://doi.org/10.1007/bf00289076openalex-snapshot
On the complexity of formal grammars
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/bfb0022661openalex-snapshot
Membership for growing context sensitive grammars is polynomial
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(82)90086-2openalex-snapshot
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
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/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
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(86)90070-3openalex-snapshot
On the membership problem for regular DNLC grammars
inferredcites →https://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
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/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2271openalex-snapshot
Breeze graph grammar: a graph grammar approach for modeling the software architecture of big data‐oriented software systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0090openalex-snapshot
Symbol–Relation Grammars: A Formalism for Graphical Languages
inferred← citeshttps://doi.org/10.1006/jcss.1996.0087openalex-snapshot
Regular Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jcss.1997.1510openalex-snapshot
Logical Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jvlc.2001.0227openalex-snapshot
An XML-based Quality of Service Enabling Language for the Web
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-51498-8_15openalex-snapshot
Context-free NCE graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_12openalex-snapshot
On the complexity of optimal drawings of graphs
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_106openalex-snapshot
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
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-58950-3_395openalex-snapshot
Designing graph drawings by layout graph grammars
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/978-1-4612-1676-6_2openalex-snapshot
A Survey of Visual Language Specification and Recognition
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_4openalex-snapshot
The CCMG Visual Language Hierarchy
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_6openalex-snapshot
Relational Grammars: Theory and Practice in a Visual Language Interface for Process Modeling
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_7openalex-snapshot
Relation Grammars: A Formalism for Syntactic and Semantic Analysis of Visual Languages
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/bfb0017374openalex-snapshot
Graph grammars based on node rewriting: an introduction to NLC graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017387openalex-snapshot
Layout graph grammars: The placement approach
inferred← citeshttps://doi.org/10.1007/bfb0017394openalex-snapshot
Context-free handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
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/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0052321openalex-snapshot
Visual language parsing: If I had a hammer...
inferred← citeshttps://doi.org/10.1007/s005300050015openalex-snapshot
Grammar-based articulation for multimedia document design
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90004-5openalex-snapshot
The complexity of regular DNLC graph languages
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90019-1openalex-snapshot
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
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/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferred← citeshttps://doi.org/10.1023/a:1013310705258openalex-snapshot
Graphical Transformation of Multimedia XML Documents
inferred← citeshttps://doi.org/10.1093/comjnl/44.3.186openalex-snapshot
A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages
inferred← citeshttps://doi.org/10.1109/32.917521openalex-snapshot
Design, construction, and application of a generic visual language generation environment
inferred← citeshttps://doi.org/10.1109/imis.2013.56openalex-snapshot
BGG: A Graph Grammar Approach for Software Architecture Verification and Reconfiguration
inferred← citeshttps://doi.org/10.1109/lics.1990.113745openalex-snapshot
On the expression of monadic second-order graph properties without quantifications over sets of edges
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.1109/vl.1997.626597openalex-snapshot
An interpreter for diagrammatic languages based on SR grammars
inferred← citeshttps://doi.org/10.1109/vl.1997.626600openalex-snapshot
Multimedia languages for teleaction objects
inferred← citeshttps://doi.org/10.1142/s0218194000000250openalex-snapshot
FORMAL SPECIFICATION AND PROTOTYPING OF MULTIMEDIA APPLICATIONS
inferred← citeshttps://doi.org/10.2139/ssrn.4571162openalex-snapshot
A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06407openalex-snapshot
A Reduction System for Optimal 1-Planar Graphs
inferred← citeshttps://doi.org/10.70675/c61185b0z5eeez481fza803zc24f00ed5139openalex-snapshot
Gestion autonomique de la QoS au niveau middleware dans l'IoT
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.