@inproceedings{BachmeierLuttenbergerSchlund:2015,
    Author = {Bachmeier, Georg and Luttenberger, Michael and Schlund, Maximilian},
    BookTitle = {Proc. of LATA'15},
    Editor = {Dediu, Adrian-Horia and Formenti, Enrico and Mart{\'\i}n-Vide, Carlos and Truthe, Bianca},
    File = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (2) (0) - a - a - y.pdf},
    ISBN = {978-3-319-15578-4},
    Keywords = {Descriptional complexity; Subword closure; Nfa equivalence; Language approximation},
    Language = {English},
    Pages = {473--485},
    Publisher = {Springer International Publishing},
    Series = {LNCS},
    Title = {Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity},
    URL = {http://dx.doi.org/10.1007/978-3-319-15579-1\_37},
    Volume = {8977},
    Year = {2015},
    bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-319-15579-1\_37},
    date-added = {2016-01-12 14:53:03 +0000},
    date-modified = {2016-01-12 14:57:26 +0000},
    file-2 = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (0) (0) - a - a - y.pdf},
    file-3 = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (1) (0) - a - a - y.pdf},
    doi = {10.1007/978-3-319-15579-1_37}
}

@inproceedings{BachmeierLuttenbergerSchlund:2015, Author = {Bachmeier, Georg and Luttenberger, Michael and Schlund, Maximilian}, BookTitle = {Proc. of LATA'15}, Editor = {Dediu, Adrian-Horia and Formenti, Enrico and Mart{\'\i}n-Vide, Carlos and Truthe, Bianca}, File = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (2) (0) - a - a - y.pdf}, ISBN = {978-3-319-15578-4}, Keywords = {Descriptional complexity; Subword closure; Nfa equivalence; Language approximation}, Language = {English}, Pages = {473--485}, Publisher = {Springer International Publishing}, Series = {LNCS}, Title = {Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity}, URL = {http://dx.doi.org/10.1007/978-3-319-15579-1_37}, Volume = {8977}, Year = {2015}, bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-319-15579-1_37}, date-added = {2016-01-12 14:53:03 +0000}, date-modified = {2016-01-12 14:57:26 +0000}, file-2 = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (0) (0) - a - a - y.pdf}, file-3 = {Finite Automata for the Sub- and Superword Closure of CFLs Descriptional and Computational Complexity - Bachmeier, Luttenberger, Schlund (1) (0) - a - a - y.pdf}, doi = {10.1007/978-3-319-15579-1_37} }