A Computer Implementation of Whitehead's Algorithm

wnew:=CFC(DWH(wold, Bset[i3],‘B‘));
> if length(wnew) then wold:=wnew; WHlist:=[op(WHlist),[Bset[i3],B]];
> j:=1;
> fi;
> od;
> fi;
> if SearchText(‘c‘,wold)>0 or SearchText(‘C‘,wold)>0
> then for i4 from 1 to 15 do
> wnew:=CFC(DWH(wold, cset[i4],‘c‘));
> if length(wnew) then wold:=wnew; WHlist:=[op(WHlist),[cset[i4],c]];
> j:=1;
> fi;
> od;
> for i5 from 1 to 15 do
> wnew:=CFC(DWH(wold, Cset[i5],‘C‘));
> if length(wnew) then wold:=wnew; WHlist:=[op(WHlist),[Cset[i5],C]];
> j:=1;
> fi;
> od;
> fi;
> if j=1 then k:=1; else k:=0; fi;
> od;
> ouput:=[wold,WHlist];
> end:
> oldminwd:=proc(wd::string)wold:=CFC(wd); wnew:=wold;
> k:=1;
> while k > 0 do
> j:=0;
> if SearchText(‘a‘,wold)>0 or SearchText(‘A‘,wold)>0
> then for i from 1 to 15 do
> wnew:=CFC(DWH(wold, aset[i],‘a‘));
> if length(wnew)