Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Pointlike sets for varieties determined by groups (1801.04638v1)

Published 15 Jan 2018 in math.GR and cs.FL

Abstract: For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike with respect to $\overline{\mathbf H}$. Our characterization is effective whenever $\mathbf H$ has a decidable membership problem. In particular, the separation problem for $\overline{\mathbf H}$-languages is decidable for any decidable variety of finite groups $\mathbf H$. This generalizes Henckell's theorem on decidability of aperiodic pointlikes.

Citations (8)

Summary

We haven't generated a summary for this paper yet.