zbMATH — the first resource for mathematics

On the geometry of semigroup presentations. (English) Zbl 0438.20041

20M05 Free semigroups, generators and relations, word problems
05C20 Directed graphs (digraphs), tournaments
Full Text: DOI
[1] Adjan, S.I, Defining relations and algorithmic problems for groups and semigroups, (), No. 85 · Zbl 0264.20027
[2] Grindlinger, E, The word problem for a class of semigroups with a finite number of defining relations, Siberian math. J., 5, 77-85, (1964) · Zbl 0178.32601
[3] Lyndon, R.C, On Dehn’s algorithm, Math. ann., 166, 208-228, (1966) · Zbl 0138.25702
[4] Lyndon, R.C; Schupp, P, Combinatorial group theory, (1977), Springer-Verlag Heidelberg · Zbl 0368.20023
[5] Malcev, A, On the immersion of an algebraic ring into a field, Math. ann., 113, 686-691, (1937) · JFM 62.1103.02
[6] Ore, O, The four-color problem, (1967), Academic Press New York · Zbl 0149.21101
[7] Schupp, P, On Dehn’s algorithm and the conjugacy problem, Math. ann., 178, 119-130, (1968) · Zbl 0164.01901
[8] Tartakovskii, V.A; Stender, P.V, On the word problem in semigroups, Mat. sb., 75, 15-38, (1968) · Zbl 0164.33602
[9] Weinbaum, F.C.M, Visualizing the word problem, with an application to sixth groups, Pacific J. math., 16, 557-578, (1966) · Zbl 0146.03302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.