TRY TO SHORTEN THE PATHS

using Nielsen transformations from combinatorial group theory.

PathForms

Generators
No specified bases, default generators a,b.

Path List

No Data

Nelisen Reduced Condition (N0) number of empty paths: 0
(N1) not satisfied;total path length: 0
(N2) not satisfied
Try to reduce to Nielsen within 0 steps, you’ve used 0.