FINITE COMPLETE REWRITING-SYSTEMS AND THE COMPLEXITY OF THE WORD PROBLEM

被引：51

作者：

BAUER, G

OTTO, F

机构：

来源：

关键词：

D O I：

10.1007/BF00271645

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：521 / 540

页数：20

共 29 条

[1]

BAUER G, 1981, THESIS U KAISERSLAUT

[2] CONFLUENT AND OTHER TYPES OF THUE SYSTEMS [J].

BOOK, RV .

[3]

BOOK RV, 1981, PROGR COMBINATORICS, P1

[4]

BUCHBERGER B, 1982, COMPUTER ALGEBRA S, V4

[5]

Buchberger B., 1970, AEQUATIONES MATH, V4, P374, DOI 10.1007/BF01844169

[6]

Davis M., 1958, COMPUTABILITY UNSOLV

[7]

DERSHOWITZ N, ATR8384782 AER CORP

[8]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[9] STRONG COMPUTABILITY AND VARIANTS OF UNIFORM HALTING PROBLEM [J].

HERMAN, GT .

ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1971, 17 (02) :115-&

[10]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR