Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
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$.
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
