Knuth-Bendix for groups with infinitely many rules

被引：1

作者：

Epstein, DBA ^{[1
]}

Sanders, PJ ^{[1
]}

机构：

[1] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England

来源：

INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION | 2000年 / 10卷 / 05期

关键词：

automatic groups; Knuth-Bendix procedure; finite state automata; word reduction;

D O I：

10.1142/S0218196700000352

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：539 / 589

页数：51

共 50 条

[41] ONLY PRIME SUPERPOSITIONS NEED BE CONSIDERED IN THE KNUTH-BENDIX COMPLETION PROCEDURE
KAPUR, D
MUSSER, DR
NARENDRAN, P
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (01) : 19 - 36
[42] AC-TERMINATION OF REWRITE SYSTEMS - A MODIFIED KNUTH-BENDIX ORDERING
STEINBACH, J
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 463 : 372 - 386
[43] COMPLETE EQUATIONAL UNIFICATION BASED ON AN EXTENSION OF THE KNUTH-BENDIX COMPLETION PROCEDURE
OHSUGA, A
SAKAI, K
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 572 : 197 - 209
[44] IT IS UNDECIDABLE WHETHER THE KNUTH-BENDIX COMPLETION PROCEDURE GENERATES A CROSSED PAIR
NARENDRAN, P
STILLMAN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 348 - 359
[45] A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering
Korovin, K
Voronkov, A
15TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2000, : 291 - 302
[46] Faster Log Analysis and Integration of Security Incidents Using Knuth-Bendix Completion
Ando, Ruo
Miwa, Shinsuke
NEURAL INFORMATION PROCESSING, PT II, 2011, 7063 : 28 - 36
[47] ABOUT THE REWRITING-SYSTEMS PRODUCED BY THE KNUTH-BENDIX COMPLETION ALGORITHM
METIVIER, Y
INFORMATION PROCESSING LETTERS, 1983, 16 (01) : 31 - 34
[48] REDUCING THE COMPLEXITY OF THE KNUTH-BENDIX COMPLETION ALGORITHM - A UNIFICATION OF DIFFERENT APPROACHES
WINKLER, F
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 378 - 389
[49] KNUTH-BENDIX COMPLETION OF HORN CLAUSE PROGRAMS FOR RESTRICTED LINEAR RESOLUTION AND PARAMODULATION
BERTLING, H
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 181 - 193
[50] The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures
Korovin, K
Voronkov, A
FST TCS 2002: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEOETICAL COMPUTER SCIENCE, PROCEEDINGS, 2002, 2556 : 230 - 240

← 1 2 3 4 5 →