Skip to main content
SpringerLink
Log in

Some decidable congruences of free monoids

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

Let W be the free monoid over a finite alphabet A. We prove that a congruence of W generated by a finite number of pairs \(\left\langle {au,u} \right\rangle\), where a ∈ A and u ∈ W, is always decidable.

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

References

  1. N. Dershowitz and J.-P. Jouannaud: Rewrite systems. Chapter 6, 243-320 in J. van Leeuwen, ed., Handbook of Theoretical Computer Science, B: Formal Methods and Semantics. North Holland, Amsterdam 1990.

    Google Scholar 

  2. J. Ježek: Free groupoids in varieties determined by a short equation. Acta Univ. Carolinae 23 (1982), 3-24.

    Google Scholar 

  3. J. Ježek and G.F. McNulty: Perfect bases for equational theories. to appear in J. Symbolic Computation.

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Sokolovská 83, 186 00, Praha 8, Czech Republic

    Jaroslav Ježek

Authors
  1. Jaroslav Ježek
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ježek, J. Some decidable congruences of free monoids. Czechoslovak Mathematical Journal 49, 475–480 (1999). https://doi.org/10.1023/A:1022459016492

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022459016492

Keywords

Search

Navigation