Recognisably Context-Free Subsets of Finitely Generated Groups

Finitely generated groups have subsets whose set of words representing the elements of the subset form a context-free language. These are called recognisably context-free sets, and they have interesting properties related to the structure of the group.