FINITE COMPLETE REWRITING-SYSTEMS FOR THE JANTZEN MONOID AND THE GREENDLINGER GROUP

被引:11
作者
OTTO, F [1 ]
机构
[1] UNIV CALIF SANTA BARBARA,DEPT MATH,SANTA BARBARA,CA 93106
关键词
D O I
10.1016/0304-3975(84)90044-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:249 / 260
页数:12
相关论文
共 26 条
[1]  
AVENHAUS J, 1977, ACTA INFORM, V9, P87, DOI 10.1007/BF00263767
[2]  
AVENHAUS J, 1984, RAIRO-INF THEOR APPL, V18, P47
[3]  
BAUER G, 1981, THESIS U KAISERSLAUT
[4]  
BOOK R, 1982, 6TH P C AUT DED, P360
[5]   CONFLUENT AND OTHER TYPES OF THUE SYSTEMS [J].
BOOK, RV .
JOURNAL OF THE ACM, 1982, 29 (01) :171-182
[6]   TESTING FOR THE CHURCH-ROSSER PROPERTY [J].
BOOK, RV ;
ODUNLAING, CP .
THEORETICAL COMPUTER SCIENCE, 1981, 16 (02) :223-229
[7]   WHEN IS A MONOID A GROUP - THE CHURCH-ROSSER CASE IS TRACTABLE [J].
BOOK, RV .
THEORETICAL COMPUTER SCIENCE, 1982, 18 (03) :325-331
[8]  
BUCHBERGER B, 1982, COMPUTER ALGEBRA S S, V4
[9]   ORDERINGS FOR TERM-REWRITING SYSTEMS [J].
DERSHOWITZ, N .
THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) :279-301
[10]  
DERSHOWITZ N, 1983, ATR8384782 AER CORP