Computing Centralisers in [Finitely Generated Free]-by-Cyclic Groups

We prove that centralisers of elements in [finitely generated free]-by-cyclic groups are computable. As a corollary, given two conjugate elements in a [finitely generated free]-by-cyclic group, the set of conjugators can be computed and the conjugacy problem with context-free constraints is decidable. We pose several problems arising naturally from this work.