Abstract In a seminal paper, Stallings introduced folding of morphisms graphs. One consequence is the representation finitely-generated subgroups finite-rank free group as immersions finite Stallings’s methods allow one to construct this algorithmically, giving effective, algorithmic answers and proofs classical questions about groups. Recently Dani–Levcovitz used Stallings-like study right-ang...