Algorithmic problems in groups and semigroups. Based on talks given at the international conference, Lincoln, NE, USA, May 11--May 16, 1998 (Q1965379)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Almeida, Jorge; Steinberg, Benjamin}, Syntactic and global semigroup theory: A synthesis approach, 1-23 [Zbl 0947.20043] \textit{Auinger, Karl}, Semigroups with central idempotents, 25-33 [Zbl 0946.20034] \textit{Baumslag, Gilbert; Myasnikov, Alexei}, Algebraic geometry over groups, 35-50 [Zbl 0946.20008] \textit{Bencsath, Katalin; Fine, Benjamin; Gaglione, Anthony M.; Myasnikov, Alexei G.; Roehl, Frank; Rosenberger, Gerhard; Spellman, Dennis}, Aspects of the theory of free groups, 51-90 [Zbl 0963.20010] \textit{Guba, V. S.}, Polynomial isoperimetric inequalities for Richard Thompson's groups \(F\), \(T\), and \(V\)., 91-120 [Zbl 1044.20504] \textit{Henckell, Karsten; Pin, Jean-Eric}, Ordered monoids and \(\mathcal J\)-trivial monoids, 121-137 [Zbl 0946.20031] \textit{Ivanov, S. V.; Schupp, P. E.}, A remark on finitely generated subgroups of free groups, 139-142 [Zbl 0945.20013] \textit{Kobayashi, Yuji}, Homotopy reduction systems for monoid presentations. II: The Guba-Sapir reduction and homotopy modules, 143-159 [Zbl 0947.20042] \textit{Kublanovskii, S. I.}, Algorithmic problems for finite groups and finite semigroups, 161-170 [Zbl 0946.20014] \textit{Otto, Friedrich}, A survey on the computational power of some classes of finite monoid presentations, 171-194 [Zbl 0945.20034] \textit{Pride, S. J.; Wang, Jing}, Rewriting systems, finiteness conditions, and associated functions, 195-216 [Zbl 0957.20047] \textit{Raymond, Jean-François; Tesson, Pascal; Thérien, Denis}, Multiparty communication complexity of finite monoids, 217-233 [Zbl 0944.68116] \textit{Ruškuc, N.}, Presentations for monoids, their maximal subgroups, and Schützenberger groups, 235-249 [Zbl 0954.20032] \textit{Shneerson, L. M.}, On the growth of relatively free semigroups, 251-265 [Zbl 0949.20045] \textit{Straubing, Howard}, When can one finite monoid simulate another?, 267-288 [Zbl 0944.68117] \textit{Weil, Pascal}, Computing closures of finitely generated subgroups of the free group, 289-307 [Zbl 0947.20020]