Solving divergence in Knuth-Bendix completion by enriching signatures

Thomas, Muffy and Watson, Phil (1993) Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science, 112 . pp. 145-185. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Item Type: Article
Uncontrolled keywords: term rewriting, Knuth-Bendix completion, regular tree languages
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 12 Aug 2009 17:09
Last Modified: 10 Jun 2014 08:49
Resource URI: https://kar.kent.ac.uk/id/eprint/21141 (The current URI for this page, for reference purposes)
  • Depositors only (login required):