Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.

Georg Bachmeier, Michael Luttenberger, Maximilian Schlund

Browse the full LATA paper archive.