Finding the Leftmost Critical Factorization on Unordered Alphabet
Abstract
We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.