Shuffle squares and reverse shuffle squares

Alon, 2016 Axenovich, 2012, A regularity lemma and twins in words, J. Combin. Theory Ser. A, 120, 733, 10.1016/j.jcta.2013.01.001 Bukh, 2018, Length of the longest common subsequence between overlapping words, SIAM J. Discrete Math., 34, 721, 10.1137/18M1176786 Bukh, 2014, Longest common subsequence in sets of words, SIAM J. Discrete Math., 28, 2042, 10.1137/140975000 Bukh, 2013, Twins in words and long common subsequences in permutations, Israel J. Math., 213, 183, 10.1007/s11856-016-1323-8 Bulteau, 2020, Recognizing binary shuffle squares is NP-hard, Theoret. Comput. Sci., 806, 116, 10.1016/j.tcs.2019.01.012 Buss, 2014, Unshuffling a square is NP-hard, J. Comput. System Sci., 80, 766, 10.1016/j.jcss.2013.11.002 Connolly, 2015, The location of the first ascent in a 123-avoiding permutation, Integers, 15 Cormen, 2001, 350 Deutsch, 1999, Dyck path enumeration, Discrete Math., 204, 167, 10.1016/S0012-365X(98)00371-9 Erickson, 2010, How hard is unshuffling a string? V. Guruswami, X. He, R. Li, The zero-rate threshold for adversarial bit-deletions is less than 1/2, in: FOCS’21. Henshall, 2012, Shuffling and unshuffling, Bull. EATCS, 107, 131 Hirschberg, 1975, A linear space algorithm for computing maximal common subsequences, Commun. ACM, 18, 341, 10.1145/360825.360861 Levenshtein, 1966, Binary codes capable of correcting deletions, insertions, and reversals, Sov. Phys. Doklady, 10, 707 OEIS Foundation Inc., 2021 OEIS Foundation Inc., 2021 R. Rizzi, S. Viallete, On recognizing words that are squares for the shuffle product, in: International Computer Science Symposium in Russia, 2013. Wilf, 1994 Xia, 2007