Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 4 - String Rewriting and 2-Polygraphs

  • from Part I - Fundamentals Of Rewriting
  • Dimitri Ara, Aix-Marseille Université, Albert Burroni, Université Paris Cité, Yves Guiraud, Université Paris Cité, Philippe Malbos, Université Claude Bernard Lyon 1, François Métayer, Université Paris Cité, Samuel Mimram, École Polytechnique, Paris
  • Book:
    Polygraphs: From Rewriting to Higher Categories
    Published online:
    18 March 2025
    Print publication:
    03 April 2025, pp 63-102

  • Summary

    This chapter recasts the notion of string rewriting system into the language of polygraphs. This notion, which consists of a set of pairs of words called relations or rewriting rules over a fixed alphabet, is introduced along with a more general variant adapted to categories. It is shown that the rewriting paths form the morphisms of a sesquicategory, in which the traditional concepts for abstract rewriting systems can be instantiated. The word problem is then introduced, and it is shown that it can be efficiently solved for convergent, i.e., confluent and terminating rewriting systems. In practice, confluence can be checked by inspecting the critical branchings of the rewriting system, and termination by introducing a suitable reduction order. The convergence of a rewriting system is also useful to show that it forms a presentation of a given category. Finally, residuation techniques are introduced, which allow proving useful properties of categories (such as the existence of pushouts) by performing computations on their presentations.