| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427507 | Information Processing Letters | 2010 | 5 Pages |
Abstract
This paper shows that weakly-non-overlapping, non-collapsing and shallow term rewriting systems are confluent, which is a new sufficient condition on confluence for non-left-linear systems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
