The fully compressed subgroup membership problem
Group Theory
2021-11-05 v2 Formal Languages and Automata Theory
Abstract
Suppose that is a free group and is a natural number. We show that the fully compressed membership problem for -generated subgroups of is solvable in polynomial time. In order to do this, we adapt the theory of Stallings' foldings to handle edges with compressed labels. This partially answers a question of Markus Lohrey.
Keywords
Cite
@article{arxiv.2110.10055,
title = {The fully compressed subgroup membership problem},
author = {Marco Linton},
journal= {arXiv preprint arXiv:2110.10055},
year = {2021}
}
Comments
11 pages, 2 figures