0
$\begingroup$

In this page: https://en.wikipedia.org/wiki/Lexicographically_minimal_string_rotation there is the Booth's Algorithm for lexicographically minimal string rotation but there is no proof. I can't access to article(https://www.sciencedirect.com/science/article/pii/0020019080901490?via%3Dihub), can someone put here the proof? Maybe also here: https://www.cambridge.org/core/books/applied-combinatorics-on-words/C64AAEDFA9A2EFE97671453EADE29E6C there is something on this argument.

$\endgroup$
2

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.