TEST SETS AND CHECKING WORDS FOR HOMOMORPHISM EQUIVALENCE

被引:17
作者
CULIK, K [1 ]
SALOMAA, A [1 ]
机构
[1] UNIV TURKU,DEPT MATH,SF-20500 TURKU 50,FINLAND
关键词
D O I
10.1016/0022-0000(80)90013-6
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:379 / 395
页数:17
相关论文
共 9 条
[1]   PURELY HOMOMORPHIC CHARACTERIZATION OF RECURSIVELY ENUMERABLE SETS [J].
CULIK, K .
JOURNAL OF THE ACM, 1979, 26 (02) :345-350
[2]   DECIDABILITY OF HOMOMORPHISM EQUIVALENCE FOR LANGUAGES [J].
CULIK, K ;
SALOMAA, A .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 17 (02) :163-175
[3]   DECIDABILITY OF EQUIVALENCE PROBLEM FOR DOL-SYSTEMS [J].
CULIK, K ;
FRIS, I .
INFORMATION AND CONTROL, 1977, 35 (01) :20-39
[4]  
CULIK K, 1979, RAIRO-INF THEOR APPL, V13, P241
[5]   HOMOMORPHISM EQUIVALENCE ON ETOL LANGUAGES [J].
CULIK, K ;
RICHIER, JL .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1979, 7 (01) :43-51
[6]  
Ehrenfeucht A., 1978, Theoretical Computer Science, V7, P169, DOI 10.1016/0304-3975(78)90047-6
[7]  
Harrison M., 1978, INTRO FORMAL LANGUAG
[8]  
Rozenberg Grzegorz, 1980, MATH THEORY L SYSTEM
[9]  
Salomaa A., 1973, FORMAL LANGUAGES