THE NIELSEN REDUCTION AND P-COMPLETE PROBLEMS IN FREE GROUPS

被引:18
作者
AVENHAUS, J
MADLENER, K
机构
关键词
D O I
10.1016/0304-3975(84)90024-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:61 / 76
页数:16
相关论文
共 10 条
[1]   SUBRECURSIVE COMPLEXITIES ON GROUPS .2. HIGMANS EMBEDDING THEOREM FOR DECIDABLE GROUPS [J].
AVENHAUS, J ;
MADLENER, K .
ACTA INFORMATICA, 1978, 9 (02) :183-193
[2]  
AVENHAUS J, 1977, ACTA INFORM, V9, P87, DOI 10.1007/BF00263767
[3]  
AVENHAUS J, 1982, LECT NOTES COMPUT SC, V144, P49
[4]  
AVENHAUS J, 1980, REV COLOMBIANA MATH, V14, P1
[5]  
Avenhaus J., 1978, ARCH MATH LOGIC, V19, P3
[6]  
AVENHAUS J, 1981, LECTURE NOTES COMPUT, V104, P42
[7]  
Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2
[8]   WORD PROBLEMS SOLVABLE IN LOGSPACE [J].
LIPTON, RJ ;
ZALCSTEIN, Y .
JOURNAL OF THE ACM, 1977, 24 (03) :522-526
[9]  
Lyndon R. C., 1977, COMBINATORIAL GROUP
[10]  
MAGNUS W, 1976, COMBINATORIAL GROUP