Theoretically analyze the optimization problem used in subword tokenization algorithms such as Byte Pair Encoding (BPE) or WordPiece. Discuss the trade-off between vocabulary size and the average sequence length of encoded text. Formulate a theoretical model where the optimal tokenization minimizes the joint cost of vocabulary size and encoding length.