Stallings foldings for rational subsets of automatic groups
Let $G$ be an automatic group with associated regular language $L$. We describe a procedure for constructing an automaton which recognises elements of a given submonoid or rational subset $K$ of $G$. This builds on work of Kharlampovich, Miasnikov and Weil, on the case where $K$ is a subgroup of $G$. Our construction succeeds, after...