USING GRAPH GRAMMARS TO DEFINE SETS OF DIGRAPHS.

被引：0

作者：

Furtado, A.L.

Mylopoulos, J.

机构：

来源：

INFOR Journal | 1979年 / 17卷 / 03期

关键词：

Compendex;

D O I：

10.1080/03155986.1979.11731737

中图分类号：

学科分类号：

摘要：

A graph grammar formalism is described and used to define several interesting sets of digraphs, such as rooted acyclic graphs and lattices. It is then argued that the formalism is descriptively powerful and that it constitutes a constructive method for the precise definition of many structures arising in computer science.

引用

页码：242 / 261

页数：19