Cyclic_locally,_but_not_globally_confluent_rewrite_system.png
Summary
Description Cyclic locally, but not globally confluent rewrite system.png |
English:
Shows a simple cyclic
abstract rewriting system
that is locally confluent, but not globally confluent. (By Newman's lemma, it is necessarily non-terminating.)
|
Date | |
Source | Own work |
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.
Original upload log
Date/Time | Dimensions | User | Comment |
---|---|---|---|
7 November 2013, 19:59:54 | 507 × 228 (1299 bytes) | Jochen Burghardt ( talk · contribs ) | User created page with UploadWizard |