On the structure of recognizable languages of dependence graphs
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A. Rudnicki (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Joost Engelfriet, George Leih (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of...
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Alain Billionnet (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
André Raspaud, Ondrej Sýkora, Imrich Vrt'o (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: