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