Title | **Complete involutive rewriting systems** |

Author(s) | Gareth Evans, Christopher D. Wensley |

Type | Article in Journal |

Abstract | Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth–Bendix critical pairs completion algorithm. It is well-known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involutive rewriting system for M . |

Keywords | Gröbner basis, String rewriting, Knuth–Bendix, Involutive basis |

ISSN | 0747-7171 |

URL |
http://www.sciencedirect.com/science/article/pii/S0747717107001046 |

Language | English |

Journal | Journal of Symbolic Computation |

Volume | 42 |

Number | 11–12 |

Pages | 1034 - 1051 |

Year | 2007 |

Note | Non-commutative Gröbner bases and applications |

Edition | 0 |

Translation |
No |

Refereed |
No |