Results 251 to 260 of about 802,028 (300)
An architecture for processing graph-grammar applications
Information Systems, 1987 We propose a six-layer architecture for processing graph-grammar applications. The layers and the transformations between them are formally described and concepts for their implementation are given.
Witt, Kurt-Ulrich
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Apex graph grammars and attribute grammars
Acta Informatica, 1988In diesem Artikel werden die ADG Graph-Grammatiken (attribute dependency graph grammars) definiert und mit anderen Klassen von Graph-Grammatiken verglichen. Die Untersuchung ist anhand der DNLC (directed node-label controlled) Graph-Grammatiken durchgeführt, die auf dem Rewriting- Mechanismus von kontextfreien Sprachen basieren.
Joost Engelfriet +2 more
openaire +2 more sources
Grammars, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Computing, 1978
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Leon S. Levy, Kang Yueh
openaire +2 more sources
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Leon S. Levy, Kang Yueh
openaire +2 more sources
Graph Grammar Formalism with Multigranularity for Spatial Graphs
Journal of Logic, Language and Information, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yufeng Liu, Fan Yang, Jian Liu
openaire +1 more source
Fundamenta Informaticae, 1993
In a probabilistic graph grammar, each production has a probability attached to it. This induces a probability assigned to each derivation tree, and to each derived graph. Conditions for this probability function to be a probabilistic measure are discussed. The statistical properties of the generated language are investigated.
openaire +4 more sources
In a probabilistic graph grammar, each production has a probability attached to it. This induces a probability assigned to each derivation tree, and to each derived graph. Conditions for this probability function to be a probabilistic measure are discussed. The statistical properties of the generated language are investigated.
openaire +4 more sources
1987
Apex graph grammars are NLC-like graph grammars with the restriction that embedding edges are established between terminal nodes only. Some basic theoretical properties of these grammars are investigated.
Joost Engelfriet +2 more
openaire +2 more sources
Apex graph grammars are NLC-like graph grammars with the restriction that embedding edges are established between terminal nodes only. Some basic theoretical properties of these grammars are investigated.
Joost Engelfriet +2 more
openaire +2 more sources
On structured graph grammars. II
Information Sciences, 1990One starts by identifying the steps generally followed when applying a rule r to a graph M in a graph grammar; then one formalizes these steps, obtaining a model called structured graph grammar. Various examples, illustrating this approach, are discussed (binary trees, pretty patterns, syntax diagrams) and many previous approaches to graph grammars are
Hans-Jörg Kreowski, Grzegorz Rozenberg
openaire +3 more sources
1995
The classical double pushout approach to the algebraic theory of graph grammars is extended to multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations ...
Francesco Parisi-Presicce +1 more
openaire +2 more sources
The classical double pushout approach to the algebraic theory of graph grammars is extended to multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations ...
Francesco Parisi-Presicce +1 more
openaire +2 more sources
Structure graphs and structure graph grammars
Information Sciences, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andries Barnard +2 more
openaire +2 more sources