Advertisement

Morphocompletion for one-relation monoids

  • John Pedersen
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ad66]
    ADYAN, S.I., Defining relations and algorithmic problems for groups and seimtroups, Tr. Mat. Inst. Akad. Nauk SSSR 85 (1966), 1–124.Google Scholar
  2. [Ad76]
    ADYAN, S.I., On transformations of words in semigroups presented by a system of defining relations, Alg. i Log. 15, 6 (1976), 611–621.Google Scholar
  3. [AO78]
    ADYAN S.I. and OGANESYAN, G.U., On the problems of equality and divisibility in semigroups with a single defining relation, Izv. Akad. Nauk SSSR, Ser. Mat. 42, 2 (1978), 219–225.Google Scholar
  4. [AO87]
    ADYAN, S.I. and OGANESYAN, G.U., Problems of equality and divisibility in semigroups with a single defining relation, Mat. Zam. 41, 3 (1987), 412–421.Google Scholar
  5. [Ev51]
    EVANS, T., On multiplicative systems defined by generators andrelations, I. Normal form theorems, Proc. Camb. Phil. Soc. 47 (1951), 637–649.Google Scholar
  6. [Og79]
    OGANESYAN, G.U., The solvability of the word problem for semigroups with a defining relation of the form A=BtC, Izv. Akad. Nauk Armjan SSSR, Ser. Mat. 14, 4 (1979), 288–291, 315 MR # 81g: 20106.Google Scholar
  7. [Og82]
    OGANESYAN, G.U., On semigroups with a single defining relation and semigroups without cycles, Izv. Akad. Nauk SSSR, Ser. Mat. 46, 1 (1982), 84–94.Google Scholar
  8. [Pe85]
    PEDERSEN, J., The word problem in absorbing varieties, Houston J. Math. 11, 4 (1985), 575–590.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • John Pedersen
    • 1
  1. 1.Department of MathematicsUniversity of South FloridaTampa

Personalised recommendations