On linguistic subsets of groups and monoids
Andr\'e Carvalho, Carl-Fredrik Nyberg-Brodda

TL;DR
This paper explores subsets of groups and monoids defined by language-theoretic properties, generalizing classical word problem approaches, and characterizes classes of groups based on language classes and decision problems.
Contribution
It generalizes Herbst's results to broader language classes, introduces $ extbf{C}^orall$-flat and $ extbf{C}^orall$-flat groups, and links these classes to decidability and subgroup membership problems.
Findings
$ extbf{C}^orall$-flat groups form a strict subclass of groups with word problem in $ extbf{C}$
Decidability of subgroup and submonoid membership problems for recursive languages
Closure of epi-$ extbf{C}$ groups under finite index subgroups for semi-$ extbf{AFL}$ classes
Abstract
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages we define the classes of -flat and -flat groups. We prove several closure results for these classes of groups, prove a connection with the word problem, and characterize -flat groups for several classes of languages. In general, we prove that the class of -flat groups is a strict subclass of the class of groups with word problem in , including for the class of recursive languages, for which -flatness for a group resp. monoid is proved to be equivalent to the decidability of the subgroup membership problem resp. the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory
