Frank Drewes. On the generation of trees by hyperedge replacement. In I. Prvara and P. Ruzicka, editors, Proc. Mathematical Foundations of Computer Science (MFCS'97), volume 1295 of Lecture Notes in Computer Science, pages 229-238. Springer, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Appligraph: Applications of Graph Transformation - First.. - Kreowski, Plump, (eds.) (1998) (Correct)
....yields a generalization of known decidability results concerning boundedness problems for functions on graphs and other domains. The functions that can be dealt with are definable by recursion on the derivation tree of a graph. This does not require a particular 9 notion of graph rewriting. In [Dre98, Dre97] the structure of hyperedge replacement graph languages consisting of (hyper)trees is investigated. It is shown that these languages can be generated by productions whose right hand sides are themselves hypertrees. However, for this one has to turn to sets of derivation trees produced by a ....
Frank Drewes. On the generation of trees by hyperedge replacement. In I. Pr'ivara and P. Ruzicka, editors, Proc. Mathematical Foundations of Computer Science
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
No context found.
Frank Drewes. On the generation of trees by hyperedge replacement. In I. Prvara and P. Ruzicka, editors, Proc. Mathematical Foundations of Computer Science (MFCS'97), volume 1295 of Lecture Notes in Computer Science, pages 229-238. Springer, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC