Tokenisation over Bounded Alphabets is Hard

The article's title suggests a focus on the computational complexity of tokenization, specifically when dealing with alphabets that have a limited number of characters. This implies a discussion of the challenges and potential limitations of tokenization algorithms in such constrained environments. The source, ArXiv, indicates this is a research paper, likely exploring theoretical aspects of the problem.