Skip to main content
SpringerLink
Log in

On the syntactic algorithm for the word problem of left distributivity

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

Here we investigate the ‘natural’ syntactic algorithm for the word problem of left distributivity, and we establish a sufficient condition which explains the convergence for all terms of a reasonable size. An algorithm for left division is also constructed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Departément de Mathématiques, ESA 6081, Université de Caen, F-14032 Caen, France. E-mail: dehornoy@math.unicaen.fr, , , , , , FR

    P. Dehornoy

Authors
  1. P. Dehornoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 8, 1996; accepted in final form October 3, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dehornoy, P. On the syntactic algorithm for the word problem of left distributivity. Algebra univers. 37, 191–222 (1997). https://doi.org/10.1007/s000120050013

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000120050013

Keywords

Search

Navigation