ON THE GENERATIVE POWER OF SEQUENTIAL AND PARALLEL PROGRAMMED GRAPH-GRAMMARS

被引：9

作者：

BUNKE, H

机构：

来源：

关键词：

D O I：

10.1007/BF02249935

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：89 / 112

页数：24

共 31 条

[1]

BARTINI C, 1979, LECT NOTES COMP SCI, V73, P139

[2]

BRENDEL W, 1977, INFORMATIK FACHBERIC, V10, P57

[3]

BUNKE H, 1979, ARBEITSBER I MATH MA, V12, P3

CULIK, K ;

LINDENMAYER, A .

[5] CONTEXT-FREE GRAPH GRAMMARS [J].

DELLAVIGNA, P ;

GHEZZI, C .

INFORMATION AND CONTROL, 1978, 37 (02) :207-233

[6]

Ehrig H., 1976, Automata, languages, development, P425

[7]

Ehrig H., 1973, 14th Annual Symposium on Switching Automata Theory, P167, DOI 10.1109/SWAT.1973.11

[8]

EHRIG H, 1977, LECT NOTES COMP SCI, V56, P245

[9]

EHRIG H, 1979, LECT NOTES COMP SCI, V73, P1, DOI DOI 10.1007/BFB0025714

[10]

FURTADO AL, 1979, LECTURE NOTES COMPUT, V73, P224