Hard Counting Problems for Partial Words
From MaRDI portal
Publication:3564883
DOI10.1007/978-3-642-13089-2_36zbMath1284.68487OpenAlexW19005284MaRDI QIDQ3564883
Publication date: 26 May 2010
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_36
Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Constructing partial words with subword complexities not achievable by full words, Number of holes in unavoidable sets of partial words. II., On minimal Sturmian partial words, Regular languages of partial words, Efficient enumeration of non-equivalent squares in partial words with few holes