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

来源：

关键词：

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 条

[1] Orienting rewrite rules with the Knuth-Bendix order
Korovin, K
Voronkov, A
INFORMATION AND COMPUTATION, 2003, 183 (02) : 165 - 186
[2] AN INTRODUCTION TO KNUTH-BENDIX COMPLETION
DICK, AJJ
COMPUTER JOURNAL, 1991, 34 (01): : 2 - 15
[3] On Transfinite Knuth-Bendix Orders
Kovacs, Laura
Moser, Georg
Voronkov, Andrei
AUTOMATED DEDUCTION - CADA-23, 2011, 6803 : 384 - +
[4] Ordinals and Knuth-Bendix Orders
Winkler, Sarah
Zankl, Harald
Middeldorp, Aart
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-18), 2012, 7180 : 420 - 434
[5] ON NONTERMINATION OF KNUTH-BENDIX ALGORITHM
HERMANN, M
PRIVARA, I
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 146 - 156
[6] FAST KNUTH-BENDIX COMPLETION - SUMMARY
CHRISTIAN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 551 - 555
[7] ON THE KNUTH-BENDIX COMPLETION FOR CONCURRENT PROCESSES
DIEKERT, V
THEORETICAL COMPUTER SCIENCE, 1989, 66 (02) : 117 - 136
[8] TOWARDS A SET OF INFERENCE RULES FOR SOLVING DIVERGENCE IN KNUTH-BENDIX COMPLETION
LANGE, S
ANALOGICAL AND INDUCTIVE INFERENCE /, 1989, 397 : 304 - 316
[9] Orienting equalities with the Knuth-Bendix order
Korovin, K
Voronkov, A
18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2003, : 75 - 84
[10] Knuth-Bendix completion as a data structure
Struth, Georg
RELATIONAL METHODS IN COMPUTER SCIENCE, 2005, 2006, 3929 : 225 - 236