Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language

Antoine Amarilli, Sven Dziadek, Luc Segoufin

For a fixed regular language $L$, the enumeration of $L$-infixes is the following task: we are given an input word $w=a_1\cdots a_n$ and we must enumerate the infixes of $w$ tha…