@inbook{Plandowski1999,
    Abstract = {The compressed recognition problem consists in checking if an input word w is in a given language L, when we are only given a compressed representation of w. We present several new results related to language recognition problems for compressed texts. These problems are solvable in polynomial time for uncompressed words and some of them become NP-hard for compressed words.},
    Address = {Berlin, Heidelberg},
    Author = {Plandowski, Wojciech and Rytter, Wojciech},
    BookTitle = {Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa},
    Editor = {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u{a}}un, Gheorghe and Rozenberg, Grzegorz},
    File = {Complexity of Language Recognition Problems for Compressed Words - 978-3-642-60207-8\_23.pdf},
    ISBN = {978-3-642-60207-8},
    Pages = {262--272},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Complexity of Language Recognition Problems for Compressed Words},
    URL = {https://doi.org/10.1007/978-3-642-60207-8\_23},
    Year = {1999},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-642-60207-8\_23},
    date-added = {2023-08-09 10:13:43 +0200},
    date-modified = {2023-08-09 10:13:43 +0200},
    doi = {10.1007/978-3-642-60207-8_23}
}

@inbook{Plandowski1999, Abstract = {The compressed recognition problem consists in checking if an input word w is in a given language L, when we are only given a compressed representation of w. We present several new results related to language recognition problems for compressed texts. These problems are solvable in polynomial time for uncompressed words and some of them become NP-hard for compressed words.}, Address = {Berlin, Heidelberg}, Author = {Plandowski, Wojciech and Rytter, Wojciech}, BookTitle = {Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa}, Editor = {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u{a}}un, Gheorghe and Rozenberg, Grzegorz}, File = {Complexity of Language Recognition Problems for Compressed Words - 978-3-642-60207-8_23.pdf}, ISBN = {978-3-642-60207-8}, Pages = {262--272}, Publisher = {Springer Berlin Heidelberg}, Title = {Complexity of Language Recognition Problems for Compressed Words}, URL = {https://doi.org/10.1007/978-3-642-60207-8_23}, Year = {1999}, bdsk-url-1 = {https://doi.org/10.1007/978-3-642-60207-8_23}, date-added = {2023-08-09 10:13:43 +0200}, date-modified = {2023-08-09 10:13:43 +0200}, doi = {10.1007/978-3-642-60207-8_23} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge