Abstract
We answer an open problem on the complexity of maintaining Compact Directed Acyclic Word Graph for a perfect sliding window and present an online algorithm for perfect sliding with asymtotically optimal running time.
We answer an open problem on the complexity of maintaining Compact Directed Acyclic Word Graph for a perfect sliding window and present an online algorithm for perfect sliding with asymtotically optimal running time.