A note on a simple computation of the maximal suffix of a string

Crochemore, 1992, String-matching on ordered alphabets, Theor. Comput. Sci., 92, 33, 10.1016/0304-3975(92)90134-2 Crochemore, 2007 Crochemore, 1991, Two-way string matching, J. ACM, 38, 651, 10.1145/116825.116845 Crochemore, 1994 Duval, 1983, Factorizing words over an ordered alphabet, J. Algorithms, 4, 363, 10.1016/0196-6774(83)90017-2 Rytter, 2003, On maximal suffixes, constant-space linear-time versions of KMP algorithm, Theor. Comput. Sci., 299, 763, 10.1016/S0304-3975(02)00590-X Shiloach, 1979, A fast equivalence-checking algorithm for circular lists, Inf. Process. Lett., 8, 236, 10.1016/0020-0190(79)90114-5 Shiloach, 1981, Fast canonization of circular strings, J. Algorithms, 2, 107, 10.1016/0196-6774(81)90013-4