MATHEMATICAL INVESTIGATION OF PROPAGATING GRAPH-OL SYSTEMS

被引：12

作者：

CULIK, K ^{[1
]}

WOOD, D ^{[1
]}

机构：

[1] MCMASTER UNIV,COMP SCI UNIT,HAMILTON L8S 4K1,ONTARIO,CANADA

来源：

INFORMATION AND CONTROL | 1979年 / 43卷 / 01期

关键词：

D O I：

10.1016/S0019-9958(79)90088-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：50 / 82

页数：33

共 27 条

[1]

Abe N., 1973, Journal of Computer and System Sciences, V7, P37, DOI 10.1016/S0022-0000(73)80049-2

[2]

CHEUNG, 1979, COMMUNICATION

CULIK, K ;

LINDENMAYER, A .

[4] DECIDABILITY OF EQUIVALENCE PROBLEM FOR DOL-SYSTEMS [J].

CULIK, K ;

FRIS, I .

INFORMATION AND CONTROL, 1977, 35 (01) :20-39

[5]

CULIK K, 1975, 8TH P HAW C SYST SCI

[6]

CULIK K, 1974, L SYSTEMS, P230

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

DELLAVIGNA, P ;

GHEZZI, C .

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

[8]

Ehrenfeucht A., 1974, Acta Informatica, V3, P265, DOI 10.1007/BF00288638

[9]

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

[10]

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