ON THE COMPLEXITY OF INTERSECTION AND CONJUGACY PROBLEMS IN FREE GROUPS

被引：5

作者：

AVENHAUS, J

MADLENER, K

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(84)90046-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：279 / 295

页数：17

共 8 条

[1] THE NIELSEN REDUCTION AND P-COMPLETE PROBLEMS IN FREE GROUPS [J].

AVENHAUS, J ;

MADLENER, K .

[2]

AVENHAUS J, 1981, LECT NOTES COMP SCI, V112, P88

[3]

Howson A. G., 1954, J LOND MATH SOC, Vs1-29, P428, DOI 10.1112/jlms/s1-29.4

[4] FINITELY GENERATED SUBGROUPS OF FREE GROUPS [J].

IMRICH, W .

[5] WORD PROBLEMS SOLVABLE IN LOGSPACE [J].

LIPTON, RJ ;

ZALCSTEIN, Y .

[6]

Lyndon R. C., 1977, COMBINATORIAL GROUP

[7]

MAGNUS W, 1976, COMBINATORIAL GROUP

[8]

MOLDAVANSKII DJ, 1969, ALGEBRA LOGIKA, V8, P394