Pages that link to "Item:Q2550295"
From MaRDI portal
The following pages link to Pair grammars, graph languages and string-to-graph translations (Q2550295):
Displaying 25 items.
- Algebraic hierarchical graph transformation (Q596311) (← links)
- On categorical graph grammars integrating structural transformations and operations on labels (Q685458) (← links)
- Semantic-syntax-directed translation and its application to image processing (Q760802) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Grammars on partial graphs (Q1227277) (← links)
- Toward a mathematical theory of graph-generative systems and its applications (Q1237578) (← links)
- A class of linearly parsable graph grammars (Q1243139) (← links)
- On labelled graph grammars (Q1245573) (← links)
- Fixed-point constructions in order-enriched categories (Q1255084) (← links)
- Structure graphs and structure graph grammars (Q1310942) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- Grammar-based model transformations: definition, execution, and quality properties (Q1749124) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Representing graph families with edge grammars (Q1801468) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Equational Reasoning with Context-Free Families of String Diagrams (Q2947216) (← links)
- 15 Years of Triple Graph Grammars (Q3540415) (← links)
- String and graph grammar characterizations of bounded regular languages (Q4194489) (← links)
- Behavioral Constraints for Visual Models1 1Research partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR network GETGRATS. (Q4921553) (← links)
- (Q5018498) (← links)
- Specification of graph translators with triple graph grammars (Q6184366) (← links)