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

We present an alternative linear-time constant-space algorithm for computing maximal suffixes in strings, which is interesting due to its especially compact description. It also provides an exercise in proving nontrivial correctness of an algorithm having a concise description. The results are of a methodological character.