✦ LIBER ✦

Categorification, term rewriting and the Knuth–Bendix procedure

✍ Scribed by Tibor Beke

Book ID: 118475768
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 280 KB
Volume: 215
Category: Article
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2010.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Knuth-Bendix completion with a term

Fast Knuth-Bendix completion with a term rewriting system compiler

✍ Yoshihito Toyama 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Orienting rewrite rules with the Knuth–B

Orienting rewrite rules with the Knuth–Bendix order

✍ Konstantin Korovin; Andrei Voronkov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 225 KB

About the rewriting systems produced by

About the rewriting systems produced by the Knuth-Bendix completion algorithm

✍ Yves Metivier 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The Knuth-Bendix procedure for strings a

The Knuth-Bendix procedure for strings as a substitute for coset enumeration

✍ Charles C. Sims 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 246 KB

This note describes two examples in which the Knuth-Bendix procedure for strings is more useful than coset enumeration for studying a finitely presented group. Coset enumeration is a procedure for verifying that a subgroup of a finitely presented group has finite index. The procedure was first desc

The Knuth-Bendix algorithm and the conju

The Knuth-Bendix algorithm and the conjugacy problem in monoids

✍ Fabienne Chouraqui 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 370 KB

Modular term rewriting systems and the t

Modular term rewriting systems and the termination

✍ Masahito Kurihara; Ikuo Kaji 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 313 KB