Hiroto Fujimaru

On the sensitivity of CDAWG-grammars

2025 · arXiv (Cornell University)

The compact directed acyclic word graph (CDAWG) [Blumer et al. 1987] of a string is the minimal compact automaton that recognizes all the suffixes of the string. CDAWGs can be used for various string tasks …