Enumerable identities of finitely generated subgroups

If a finitely generated group embeds in a finitely presented group, its null words in any fixed finite generating set form a recursively enumerable set. Choose words for the generator images in the larger group. Enumerate finite products of conjugates of its defining relators and their inverses, freely reduce, and compare with substituted words. Dovetailing over input words enumerates exactly the subgroup's identities. Choosing the finite image words is nonuniform, but their existence suffices for existence of an enumeration algorithm.