BOUNDED AFLS

被引:15
作者
GOLDSTINE, J [1 ]
机构
[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802
关键词
D O I
10.1016/S0022-0000(76)80010-4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:399 / 419
页数:21
相关论文
共 15 条
[1]   BOUNDED ALGOL-LIKE LANGUAGES [J].
GINSBURG, S ;
SPANIER, EH .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1964, 113 (02) :333-+
[2]   INTERSECTION-CLOSED FULL AFL AND RECURSIVELY ENUMERABLE LANGUAGES [J].
GINSBURG, S ;
GOLDSTINE, J .
INFORMATION AND CONTROL, 1973, 22 (03) :201-231
[3]  
GINSBURG S, 1966, MATHEMATICAL THEORY
[4]  
GINSBURG S, 1969, 87 AM MATH SOC MEM, P1
[5]   SOME INDEPENDENT FAMILIES OF ONE-LETTER LANGUAGES [J].
GOLDSTINE, J .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) :351-369
[6]  
Goldstine J., 1970, THESIS U CALIFORNIA
[7]  
GOLDSTINE J, 1972, J COMPUT SYST SCI, V6, P9
[8]  
GOLDSTINE J, IN PRESS
[9]  
GREIBACH S, 1972, J ACM, V19, P193, DOI 10.1145/321694.321695
[10]  
GREIBACH S, 1970, MATH SYST THEORY, V4, P231