On normalizing, non-terminating one-rule string rewriting systems
Author:
- 28 July 2000
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 243 (1-2) , 489-498
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Non-Looping String RewritingRAIRO - Theoretical Informatics and Applications, 1999
- On termination of confluent one-rule string-rewriting systemsInformation Processing Letters, 1997
- Calcul de longueurs de chaînes de réécriture dans le monoïde libreTheoretical Computer Science, 1985
- Das Identit tsproblem f r Gruppen mit einer definierenden RelationMathematische Annalen, 1932