Non-cyclic_locally,_but_not_globally_confluent_rewrite_system.gif
Summary
Description Non-cyclic locally, but not globally confluent rewrite system.gif |
English:
Shows an infinite non-cyclic abstract rewrite system that is locally confluent, but not globally confluent. (By Newman's lemma, it is necessarily non-terminating.)
|
Date | |
Source | Own work , inspired by Fig.2b, p.268 of: N. Dershowitz and J.-P. Jouannaud (1990) Jan van Leeuwen , ed. Formal Models and Semantics , Handbook of Theoretical Computer Science, B, Elsevier, pp. 243–320 ISBN : 0-444-88074-7 . |
Author | Jochen Burghardt |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the
Creative Commons
Attribution-Share Alike 3.0 Unported
license.
-
You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
-
Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.