Computing Critical Pairs in 2-Dimensional Rewriting Systems

Samuel Mimram
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative for the elements of the presented monoid. Polygraphs are a higher-dimensional generalization of this notion of presentation, from the setting of monoids to the much more general setting of...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.