I understand that the regular expressions for LaTeX are too complicated, which makes the search slow, and that there are cases where it does not match LaTeX formulas properly when the BOUND argument is specified.
While the slow search due to the complexity of regular expressions is a problem, I am focusing on the asymptotic complexity of the computation between typing a character and displaying it, which has changed since 80268c0e0. In earlier revisions, the asymptotic complexity was probably a constant time O(1) for N characters in the buffer. This is ideal because it allows typing at a constant rate regardless of the number of characters in the buffer. The asymptotic complexity for subsequent revisions is probably linear time O(N). This means that if the number of characters in the buffer increases by a factor of 10, the typing speed may decrease by a factor of 10. I have reported this because I think that typing and deleting characters with O(N) is not a good situation for me, but since there seems to be no general solution, I have decided to give up fontification of LaTeX formulas for the time being.
