I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

Reference:

Georg Bachmeier, Michael Luttenberger, and Maximilian Schlund. Finite automata for the sub- and superword closure of cfls: Descriptional and computational complexity. In to appaear in: Language and Automata Theory and Applications - 9th International Conference, LATA 2015, 2015.

Suggested BibTeX entry:

@inproceedings{DBLP:journalscorrBachmeierLS14,
    author = {Georg Bachmeier and Michael Luttenberger and Maximilian Schlund},
    booktitle = {to appaear in: Language and Automata Theory and Applications - 9th International Conference, {LATA} 2015},
    title = {Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity},
    year = {2015}
}

This work is not available online here.