DECIDABLE PROPERTIES OF MONADIC FUNCTIONAL SCHEMAS

被引：19

作者：

ASHCROFT, E

MANNA, Z

PNUELI, A

机构：

[1] STANFORD UNIV,STANFORD,CA 94305

[2] WEIZMANN INST SCI,APPL MATH DEPT,REHOVOTH,ISRAEL

[3] UNIV WATERLOO,COMP SCI DEPT,WATERLOO,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1145/321765.321780

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：489 / 499

页数：11

共 9 条

[1]

DEBAKKER JW, UNPUBLISHED NOTES

[2]

Hopcroft JE, 1969, Formal languages and their relation to automata

[3]

IANOV YI, 1960, PROBLEMS CYBERNETICS, V1

[4]

Korenjak A.J., 1966, SWAT, P36, DOI [DOI 10.1109/SWAT.1966.22, 10.1109/SWAT.1966.22]

[5]

Luckham D. C., 1970, Journal of Computer and System Sciences, V4, P220, DOI 10.1016/S0022-0000(70)80022-8

[6]

MCCARTHY J, 1963, COMPUTER PROGRAMMING

[7]

PATERSON MS, UNPUBLISHED MEMO

[8] PROPERTIES OF DETERMINISTIC TOP-DOWN GRAMMARS [J].

ROSENKRANTZ, DJ ;

STEARNS, RE .

INFORMATION AND CONTROL, 1970, 17 (03) :226-+

[9] ON IANOVS PROGRAM SCHEMATA [J].

RUTLEDGE, JD .