Skip to main content
Log in

A reduction theorem for complexity of finite semigroups

  • Research Articles
  • 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

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

Instant access to the full article PDF.

References

  1. Allen, D. Jr.,A generalization of the Rees Theorem to a class of regular semigroups, Semigroup Forum 2 (1971), 321–331.

    Google Scholar 

  2. Clifford, A.H. and G.B. Preston,The algebraic theory of semigroups, Vol. 1, Amer. Math. Soc., Providence, R.I., 1961.

    Google Scholar 

  3. Rhodes, J.,Finite binary relations have no more complexity than finite functions, Semigroup Forum, to appear.

  4. Rhodes, J.,Kernel systems -a global study of homo-morphisms on finite semigroups, to appear.

  5. Tilson, B.,On the p-length of p-solvable semigroups: preliminary results, in “Semigroups,” Academic Press, N.Y., 1969.

    Google Scholar 

  6. Tilson, B.,Decomposition and complexity of finite semigroups, Semigroup Forum 3 (1971), 189–250.

    Google Scholar 

  7. Tilson, B.,On the complexity of finite emigroups, J. of Pure and Applied Algebra, to appear.

  8. Tilson, B.,Complexity of two-J class semigroups, Adv. in Math. 11 (1973), 215–237.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rhodes, J., Tilson, B. A reduction theorem for complexity of finite semigroups. Semigroup Forum 10, 96–114 (1975). https://doi.org/10.1007/BF02194878

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation