158
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

On Finite Complete Presentations and Exact Decompositions of Semigroups

&
Pages 3866-3878 | Received 12 Oct 2009, Published online: 14 Oct 2011

REFERENCES

  • Anick , D. J. ( 1986 ). On the homology of associative algebras . Trans. Amer. Math. Soc. 296 ( 2 ): 641 – 659 .
  • Araújo , I. M. ( 2002 ). Finite presentability of semigroup constructions . Internat. J. Algebra Comput. 12 ( 1–2 ): 19 – 31 , 2002. International Conference on Geometric and Combinatorial Methods in Group Theory and Semigroup Theory, Lincoln, NE, 2000 .
  • Ayik , H. , Ru[sbreve]kuc , N. ( 1999 ). Generators and relations of Rees matrix semigroups . Proc. Edinburgh Math. Soc. (2) , 42 ( 3 ): 481 – 495 .
  • Book , R. V. , Otto , F. ( 1993 ). String-Rewriting Systems . Texts and Monographs in Computer Science. New York : Springer-Verlag .
  • Catino , F. ( 1987 ). Factorizable semigroups . Semigroup Forum 36 ( 2 ): 167 – 174 .
  • Cremanns , R. , Otto , F. (1996). For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3 . J. Symbolic Comput. 22(2):155–177.
  • Gray , R. , Malheiro, A ( 2011 ). Finite complete rewriting systems for regular monoids . Theoretical Computer Science 412 : 654 – 661 .
  • Gray , R. , Malheiro , A. ( 2010 ). A monoid is defined by a complete semigroup presentation if and only if it is defined by a complete monoid presentation . Technical report, CAUL, 2010. http://pessoa.fct.unl.pt/ajm/TechRep/CRSforMonoids.pdf .
  • Groves , J. R. J. , Smith , G. C. ( 1993 ). Soluble groups with a finite rewriting system . Proc. Edinburgh Math. Soc. (2) 36 ( 2 ): 283 – 288 .
  • Hickey , J. B. ( 1983 ). Semigroups under a sandwich operation . Proc. Edinburgh Math. Soc. (2) 26 ( 3 ): 371 – 382 .
  • Howie , J. M. ( 1995 ). Fundamentals of Semigroup Theory, Volume 12 of London Mathematical Society Monographs. New Series . New York : The Clarendon Press Oxford University Press, Oxford Science Publications .
  • Kambites , M. ( 2005 ). Presentations for semigroups and semigroupoids . Int. J. Algebra Comput. 15 ( 2 ): 291 – 308 .
  • Kuhn , N. , Madlener , K. ( 1989 ). A method for enumerating cosets of a group presented by a canonical system . In: ISSAC ′89: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation , New York , NY , USA : ACM , pp. 338 – 350 .
  • Kunze , M. ( 1983 ). Zappa products . Acta Math. Hungar. 41 ( 3–4 ): 225 – 239 .
  • Lawson , M. V. ( 2000 ). Rees matrix semigroups over semigroupoids and the structure of a class of abundant semigroups . Acta Sci. Math. 66 ( 3–4 ): 517 – 540 .
  • Liebeck , M. W. , Praeger , C. E. , Saxl , J. ( 2010 ). Regular subgroups of primitive permutation groups . Mem. Amer. Math. Soc. 203 ( 952 ): vi+ 74 .
  • Malheiro , A. ( 2006 ). Finite derivation type for Rees matrix semigroups . Theor. Comput. Sci. 355 ( 3 ): 274 – 290 .
  • Malheiro , A. ( 2008 ). On finite semigroup cross-sections and complete rewriting systems . In: Majkic , Z. , Sipser , M. , Radha , R. , Wei , D. , eds. TMFCS : ISRST , pp. 59 – 63 .
  • Malheiro , A. ( 2009 ). Finite derivation type for large ideals . Semigroup Forum 78 ( 3 ): 450 – 485 .
  • Neumann , B. H. ( 1935 ). Decompositions of groups . J. London Math. Soc. 10 .
  • Otto , F. ( 1984 ). Conjugacy in monoids with a special Church-Rosser presentation is decidable . Semigroup Forum 29 ( 1–2 ): 223 – 240 .
  • Pride , S. J. ( 1999 ). Low-dimensional homotopy for monoids II. Groups . Glasg. Math. J. 41 ( 1 ): 1 – 11 .
  • Pride , S. J. , Wang , J. ( 2000 ). Rewriting systems, finiteness conditions, and associated functions . In: Algorithmic Problems in Groups and Semigroups (Lincoln, NE, 1998), Trends Math. Boston , MA : Birkhäuser Boston , pp. 195 – 216 .
  • Pride , S. J. , Wang , J. ( 2000 ). Subgroups of finite index in groups with finite complete rewriting systems . Proc. Edinburgh Math. Soc. (2) 43 ( 1 ): 177 – 183 .
  • Rees , D. ( 1940 ). On semi-groups . Proc. Cambridge Philos. Soc. 36 : 387 – 400 .
  • Séguier , J. A. ( 1904 ). Théorie des groupes finis: Éléments de la théorie des groupes abstraits. Gauthier-Villars .
  • Squier , C. C. , Otto , F. , Kobayashi. Y. ( 1994 ). A finiteness condition for rewriting systems . Theoret. Comput. Sci. 131 ( 2 ): 271 – 294 .
  • Szép , J. ( 1950 ). On the structure of groups which can be represented as the product of two subgroups . Acta Sci. Math. Szeged , 12(Leopoldo Fejer et Frederico Riesz LXX annos natis dedicatus, Pars A):57–61 .
  • Terese. (2003). Term Rewriting Systems, Volume 55 of Cambridge Tracts in Theoretical Computer Science . Cambridge : Cambridge University Press.
  • Wang , J. ( 1998 ). Finite derivation type for semi-direct products of monoids . Theoret. Comput. Sci. 191 ( 1–2 ): 219 – 228 .
  • Guido , Zappa. ( 1942 ). Sulla costruzione dei gruppi prodotto di due dati sottogruppi permutabili tra loro . In: Atti Secondo Congresso Un. Mat. Ital., Bologna, 1940. Rome : Edizioni Cremonense , pp. 119 – 125 .
  • Communicated by M. Kambites.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.