We show that the Left Pattern Matching predictor is perfect and optimal over Bernoulli source models. We prove the proposition by induction on the size of the text. We reduce the size of a text by using the simple trick of enlarging the size of the alphabet via the use of bucket symbols. We prove the induction on an enlarged problem on weighted pattern matching with the use of pairing cost matrix.