A very simple questions. Let B be the BWT (Burrows–Wheeler transform) of a string S. My question is, due to "grouping" of consecutive characters in BWT, is it possible to somehow know the number of equal characters that follow given the first character of its kind (or at least some lower bound on the number of such characters). So let say B=...caaaaabaccccccacc... then, is it possible to know that after the first a there will be at least 2 consecutive a's or maybe the exact number of a's that follow?
Or alternatively one can pose a complementary question, a flip side of the above question (I write the question in order to better describe the problem):
Is there a better way to find breaks in BWT aside from checking each character and comparing it with the previous one. That is, let say I want to locate "ab" break. I would need to go from left to right and compare second character with the first one and then third with the second and so on until I find out where the pair mismatches. Is there a way to check every second character and come to the same result, because if this is possible then there exist a lower bound on the number of same consecutive characters (which is 2)?