The rational subset membership problem for groups: a survey
From MaRDI portal
Publication:2990055
DOI10.1017/CBO9781316227343.024zbMath1346.20043MaRDI QIDQ2990055
Publication date: 29 July 2016
Published in: Groups St Andrews 2013 (Search for Journal in Brave)
finitely generated groupsfinitely generated monoidsrational subset membership problemrational subsets of groups
Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (13)
Unnamed Item ⋮ Rational, recognizable, and aperiodic partially lossy queue languages ⋮ On the word problem for special monoids ⋮ The emptiness problem for valence automata over graph monoids ⋮ 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ On the membership problem for finite automata over symmetric groups ⋮ The monoid of queue actions ⋮ Two problems for solvable and nilpotent groups ⋮ Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups ⋮ New results on the prefix membership problem for one-relator groups ⋮ Free idempotent generated semigroups: the word problem and structure via gain graphs
This page was built for publication: The rational subset membership problem for groups: a survey