Pair grammars, graph languages and string-to-graph translations

From MaRDI portal
Revision as of 05:39, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2550295

DOI10.1016/S0022-0000(71)80016-8zbMath0229.68029OpenAlexW2093311785MaRDI QIDQ2550295

Terrence W. Pratt

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(71)80016-8




Related Items (26)

String grammars with disconnecting or a basic root of the difficulty in graph grammar parsingCharacteristics of graph languages generated by edge replacementAlgebraic hierarchical graph transformationPower properties of NLC graph grammars with a polynomial membership problemEquational Reasoning with Context-Free Families of String DiagramsFormalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacementMultilevel graph grammarsSpecification of graph translators with triple graph grammarsUnnamed ItemOn the generative power of sequential and parallel programmed graph grammars15 Years of Triple Graph GrammarsGrammar-based model transformations: definition, execution, and quality propertiesGraph grammars according to the type of input and manipulated data: a surveyOn categorical graph grammars integrating structural transformations and operations on labelsContext-free hypergraph grammars have the same term-generating power as attribute grammarsBehavioral Constraints for Visual Models1 1Research partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR network GETGRATS.Grammars on partial graphsToward a mathematical theory of graph-generative systems and its applicationsA class of linearly parsable graph grammarsOn labelled graph grammarsFixed-point constructions in order-enriched categoriesRepresenting graph families with edge grammarsString and graph grammar characterizations of bounded regular languagesSemantic-syntax-directed translation and its application to image processingStructure graphs and structure graph grammarsHierarchical graph transformation


Uses Software



Cites Work




This page was built for publication: Pair grammars, graph languages and string-to-graph translations