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.
$\begingroup$
$\endgroup$
2
-
1$\begingroup$ Actually, the second book is available online without having to "sail the high seas": google.com/url?sa=t&source=web&rct=j&url=http://… $\endgroup$– integratorJan 17, 2020 at 23:16
-
$\begingroup$ Thank you very much. $\endgroup$– asvJan 18, 2020 at 8:24
Add a comment
|