Thomas, Muffy, 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) (KAR id:21141)
| 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. |
| 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, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Mark Wheadon |
| Date Deposited: | 12 Aug 2009 17:09 UTC |
| Last Modified: | 20 May 2025 10:07 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21141 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Total Views
Total Views
