Following Babai’s algorithm (Graph isomorphism in quasipolynomial time, arXiv:1512.03547v2, 2016) for the string problem, we determine that it is possible to write expressions of short length describing certain permutation cosets, including all subgroups. This feasible both original version and its CFSG-free version, by Babai (2016, §13.1) Pyber (A analysis GI algorithm, arXiv:1605.08266, 2016)...