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 条

[31] Derivation lengths and order types of Knuth-Bendix orders
Lepper, I
THEORETICAL COMPUTER SCIENCE, 2001, 269 (1-2) : 433 - 450
[32] Knuth-Bendix completion of theories of commuting group endomorphisms
Stump, A
Löchner, B
INFORMATION PROCESSING LETTERS, 2006, 98 (05) : 195 - 198
[33] A SIMPLE NON-TERMINATION TEST FOR THE KNUTH-BENDIX METHOD
PLAISTED, DA
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 79 - 88
[34] Characterising Space Complexity Classes via Knuth-Bendix Orders
Bonfante, Guillaume
Moser, Georg
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 142 - +
[35] Knuth－Bendix过程的发散现象的研究
陈意云
计算机学报, 1994, (06) : 464 - 468
[36] The decidability of the first-order theory of Knuth-Bendix order
Zhang, T
Sipma, HB
Manna, Z
AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 131 - 148
[37] A THEOREM-PROVING APPROACH TO THE KNUTH-BENDIX COMPLETION ALGORITHM
KUCHLIN, W
LECTURE NOTES IN COMPUTER SCIENCE, 1982, 144 : 101 - 108
[38] FAST KNUTH-BENDIX COMPLETION WITH A TERM REWRITING SYSTEM COMPILER
TOYAMA, Y
INFORMATION PROCESSING LETTERS, 1989, 32 (06) : 325 - 328
[39] An extension of the Knuth-Bendix ordering with LPO-like properties
Ludwig, Michel
Waldmann, Uwe
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 348 - +
[40] A higher-order Knuth-Bendix procedure and its applications
Kusakari, Keiichirou
Chiba, Yuki
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (04) : 707 - 715

← 1 2 3 4 5 →