SIMPLE CONTEXT-FREE LANGUAGES AND FREE MONADIC RECURSION SCHEMES

被引：5

作者：

FRIEDMAN, EP

机构：

[1] UNIV CALIF LOS ANGELES,DEPT COMP SCI,LOS ANGELES,CA 90024

[2] UNIV CALIF LOS ANGELES,DEPT SYST SCI,LOS ANGELES,CA 90024

来源：

MATHEMATICAL SYSTEMS THEORY | 1977年 / 11卷 / 01期

关键词：

D O I：

10.1007/BF01768465

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：9 / 28

页数：20

共 16 条

[1]

ASCROFT E, 1973, JACM, V20, P489

[2]

COURCELLE B, 1975, ENSEMBLES ALGEBRIQUE

[3]

FRIEDMAN E, TO BE PUBLISHED

[4]

Garland S. J., 1973, Journal of Computer and System Sciences, V7, P119, DOI 10.1016/S0022-0000(73)80040-6

[5]

Geller M. M., 1973, 14th Annual Symposium on Switching Automata Theory, P103, DOI 10.1109/SWAT.1973.3

[6] DETERMINISTIC CONTEXT FREE LANGUAGES [J].

GINSBURG, S ;

GREIBACH, S .

INFORMATION AND CONTROL, 1966, 9 (06) :620-&

[7]

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

[8]

GREIBACH SA, COMMUNICATION

[9]

Harrison M. A., 1973, Journal of Computer and System Sciences, V7, P237, DOI 10.1016/S0022-0000(73)80008-X

[10]

Hopcroft J.E., 1966, SWAT, P36, DOI DOI 10.1109/SWAT.1966.22