THUE SYSTEMS AS REWRITING-SYSTEMS

被引：58

作者：

BOOK, RV ^{[1
]}

机构：

[1] MATH SCI RES INST,BERKELEY,CA

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1987年 / 3卷 / 1-2期

关键词：

D O I：

10.1016/S0747-7171(87)80021-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：39 / 68

页数：30

共 78 条

[1]

ADJAN SI, 1966, P STEKLOV I MATH, V0085

[2]

[Anonymous], 2004, COMBINATORIAL GROUP

[3] ON THE COMPLEXITY OF INTERSECTION AND CONJUGACY PROBLEMS IN FREE GROUPS [J].

AVENHAUS, J ;

MADLENER, K .

THEORETICAL COMPUTER SCIENCE, 1984, 32 (03) :279-295

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

AVENHAUS, J ;

MADLENER, K .

THEORETICAL COMPUTER SCIENCE, 1984, 32 (1-2) :61-76

[5] GROUPS PRESENTED BY FINITE 2-MONADIC CHURCH-ROSSER THUE SYSTEMS [J].

AVENHAUS, J ;

MADLENER, K ;

OTTO, F .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1986, 297 (02) :427-443

[6]

AVENHAUS J, 1984, INFORMATIQUE THEORIQ, V18, P47

[7]

Avenhaus J., 1978, ARCH MATH LOGIC, V19, P3

[8] FINITE COMPLETE REWRITING-SYSTEMS AND THE COMPLEXITY OF THE WORD PROBLEM [J].

BAUER, G ;

OTTO, F .

ACTA INFORMATICA, 1984, 21 (05) :521-540

[9] NORMAL LEVEL REWRITING-SYSTEMS [J].

BAUER, G .

THEORETICAL COMPUTER SCIENCE, 1985, 40 (2-3) :85-99

[10]

BAUER G, 1984, THESIS U KAISERSLAUT

← 1 2 3 4 5 6 7 8 →