Abstract: Florin Manea |
ON SOME ALGORITHMIC PROBLEMS IN THE AREA OF COMBINATORICS ON PARTIAL WORDS
Combinatorial properties of partial words. Also, I will show that a series of counting problems that have efficient solutions in the case of normal words are NP-hard for partial words. |