Results 241 to 250 of about 614,117 (293)
Graph compression using graph grammars. [PDF]
, 2018 This thesis presents work done on compressed graph representations via hyperedge replacement grammars. It comprises two main parts. Firstly the RePair compression scheme, known for strings and trees, is generalized to graphs using graph grammars. Given an object, the scheme produces a small context-free grammar generating the object (called a “straight-
Peternek, Fabian Hans Adolf
core +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1974
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
exaly +3 more sources
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
exaly +3 more sources
Acta Informatica, 1976
The concept of Chomsky-grammars is generalized to graph-grammars; the "gluing" of graphs is defined by a pushout-construction. In the present paper, we allow the left-hand and right-hand side of a production to be partial graphs, i.e. graphs in which there may be edges without a source or target node.
Hans Jürgen Schneider, Hartmut Ehrig
openaire +2 more sources
The concept of Chomsky-grammars is generalized to graph-grammars; the "gluing" of graphs is defined by a pushout-construction. In the present paper, we allow the left-hand and right-hand side of a production to be partial graphs, i.e. graphs in which there may be edges without a source or target node.
Hans Jürgen Schneider, Hartmut Ehrig
openaire +2 more sources
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