A PUSHDOWN AUTOMATON OR A CONTEXT-FREE GRAMMAR - WHICH IS MORE ECONOMICAL

被引：14

作者：

GOLDSTINE, J

PRICE, JK

WOTSCHKE, D

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(82)90110-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：33 / 40

页数：8

共 13 条

[1]

Aho A.V., 1972, THEORY PARSING TRANS, V1

[2]

Geller M. M., 1977, Theoretical Computer Science, V4, P143, DOI 10.1016/0304-3975(77)90033-0

[3] SIZE COMPLEXITY IN CONTEXT-FREE GRAMMAR FORMS [J].

GINSBURG, S ;

LYNCH, N .

[4]

Ginsburg S., 1966, MATH THEORY CONTEXT

[5]

Ginsburg S., 1966, SIAM J CONTROL, V4, P423

[6]

GRUSKA J, 1976, 1976 P C MATH F COMP, V45, P65

[7]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[8]

MEYER AR, 1971, 12TH P IEEE S SWITCH, P188

[9]

Ogden W., 1968, Mathematical Systems Theory, V2, P191, DOI 10.1007/BF01694004

[10]

PIRICKA A, 1974, LECTURE NOTES COMPUT, V28, P292