Skip to main content
SpringerLink
Log in

Reidemeister-Schreier type rewriting for semigroups

  • Research Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

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

References

  1. Campbell, C.M., E.F. Robertson, N. Ruškuc and R.M. Thomas,Semigroup and group presentations, Bull. London Math. Soc., to appear.

  2. Campbell, C.M.,Rewriting a semigroup presentation, Internat. J. Algebra Comput., to appear.

  3. Campbell, C.M.,Semigroup presentations and minimal ideals, submitted.

  4. Howie, J.M., “An Introduction to Semigroup Theory”, Academic Press, London, 1976.

    MATH  Google Scholar 

  5. Howie, J.M., and N. Ruškuc,Constructions and presentatons for monoids, Comm. Algebra, to appear.

  6. Jura, A.,Coset enumeration in a finitely presented semigroup, Canad. Math. Bull.21(1978), 37–46.

    MATH  MathSciNet  Google Scholar 

  7. —,Determining ideals of a given finite index in a finitely presented semigroup, Demonstratio Math.11(1978), 813–827.

    MATH  MathSciNet  Google Scholar 

  8. Lallement, G., “Semigroups and Combinatorial Applications”, John Wiley, New York, 1976.

    Google Scholar 

  9. Magnus, W., A. Karrass and D. Solitar, “Combinatorial Group Theory”, Dover, New York, 1976.

    MATH  Google Scholar 

  10. Neumann, B.H.,Some remarks on semigroup presentations, Canad. J. Math.19(1967), 1018–1026.

    MathSciNet  Google Scholar 

  11. Robertson, E.F., and Y. Ünlü,On semigroup presentations, Proc. Edinburgh Math. Soc.36(1993), 55–68.

    Article  MATH  MathSciNet  Google Scholar 

  12. Sims, C.C., “Computation with Finitely Presented Groups”, Cambridge University Press, Cambridge, 1994.

    MATH  Google Scholar 

  13. Spehner, J.C.,Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre, Semigroup Forum9(1975), 334–353.

    Article  MathSciNet  Google Scholar 

  14. Todd, J.A., and H.S.M. Coxeter,A practical method for enumerating the cosets of a finite abstract group, Proc. Edinburgh Math. Soc.5(1936), 26–34.

    MATH  Google Scholar 

  15. Walker, T.G., “Semigroup Enumeration-Computer Implementation and Applications”, Ph.D. Thesis, University of St Andrews, 1992.

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, University of St Andrews, KY16 9SS, St Andrews, Scotland

    C. M. Campbell, E. F. Robertson & N. Ruškuc

  2. Department of Mathematics and Computer Science, University of Leicester, LE1 7RH, Leicester, England

    R. M. Thomas

Authors
  1. C. M. Campbell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. F. Robertson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Ruškuc
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. M. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by John M. Howie

The author wishes to acknowledge support from the Edinburgh Mathematical Society Centenary Fund and the European Community grant ERBCHRXCT930418

Rights and permissions

Reprints and permissions

About this article

Cite this article

Campbell, C.M., Robertson, E.F., Ruškuc, N. et al. Reidemeister-Schreier type rewriting for semigroups. Semigroup Forum 51, 47–62 (1995). https://doi.org/10.1007/BF02573619

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation