VERY SPECIAL LANGUAGES AND REPRESENTATIONS OF RECURSIVELY-ENUMERABLE LANGUAGES VIA COMPUTATION HISTORIES

被引：5
作者：
HAUSSLER, D
ZEIGER, HP
机构：
来源：
INFORMATION AND CONTROL | 1980年 / 47卷 / 03期
关键词：
D O I：
10.1016/S0019-9958(80)90537-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：201 / 212
页数：12
相关论文
共 19 条
[1]   REVERSAL-BOUNDED MULTIPUSHDOWN MACHINES [J].
BAKER, BS ;
BOOK, RV .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (03) :315-332
[2]   DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC FINITE TRANSDUCERS [J].
BLATTNER, M ;
HEAD, T .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 19 (01) :45-49
[3]  
BOOK RV, 1978, LECTURE NOTES COMPUT, V62, P113
[4]  
BRANDENBURG FJ, 1979, 1979 ACM S FORM LANG
[5]   DECIDABILITY OF HOMOMORPHISM EQUIVALENCE FOR LANGUAGES [J].
CULIK, K ;
SALOMAA, A .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 17 (02) :163-175
[6]  
EHRENFEUCHT A, 1979, CUCS16179 U COL DEP
[7]  
EHRENFEUCHT A, 1979, CUCS15979 U COL DEP
[8]   FIXED-POINT LANGUAGES, EQUALITY LANGUAGES, AND REPRESENTATION OF RECURSIVELY-ENUMERABLE LANGUAGES [J].
ENGELFRIET, J ;
ROZENBERG, G .
JOURNAL OF THE ACM, 1980, 27 (03) :499-518
[9]  
FISHER GA, 1969, 10TH P ANN S SWITCH, P157
[10]  
Ginsburg S., 1973, Journal of Computer and System Sciences, V7, P1, DOI 10.1016/S0022-0000(73)80047-9
12