On algorithmic problems for joins of pseudovarieties

DOI10.1007/s002330010002zbMath0980.20055OpenAlexW2075032826MaRDI QIDQ5930161

Benjamin Steinberg

Publication date: 10 July 2001

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002330010002

zbMATH Keywords

word problemcompletely regular semigroups\(\mathcal J\)-trivial semigroupsbases of pseudoidentitiesdecidable membership problemfinite semigroupsidempotent pointlikesimplicit operationsjoins of pseudovarietiesMalcev productspseudovarieties of semigroups

Mathematics Subject Classification ID

Lattices of varieties (08B15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, etc. in computability and recursion theory (03D40) Quasivarieties (08C15)

Related Items (9)

Functor homology and homology of commutative monoids ⋮ Pointlike sets and separation: a personal perspective ⋮ Pointlike sets for varieties determined by groups ⋮ Closures of regular languages for profinite topologies. ⋮ Finite state automata: A geometric approach ⋮ Pointlike sets with respect to R and J. ⋮ The geometry of profinite graphs with applications to free groups and finite monoids ⋮ Varieties ⋮ Profinite topologies

This page was built for publication: On algorithmic problems for joins of pseudovarieties