Identity problems, solvability of equations and unification in varieties of semigroups related to varieties of groups

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this survey we consider three kinds of algorithmic questions concerning varieties of semigroups. We are interested in identity problems, in the solvability of a system of equations and in the structure of all solutions of a given system. We study them in significant varieties of semigroups, monoids, groups, completely simple semigroups, completely regular semigroups (in particular semigroups satisfying the identity x r ∈≈∈x) and involutary semigroups (in particular star regular semigroups and inverse semigroups). © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Klíma, O., & Polák, L. (2011). Identity problems, solvability of equations and unification in varieties of semigroups related to varieties of groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7020 LNCS, pp. 214–227). https://doi.org/10.1007/978-3-642-24897-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free