Combinatorial Queries and Updates on Partial Words
From MaRDI portal
Publication:3183600
DOI10.1007/978-3-642-03409-1_10zbMath1252.68218OpenAlexW1481494099MaRDI QIDQ3183600
Cătălin Tiseanu, Florin Manea, Adrian-Viorel Diaconu
Publication date: 20 October 2009
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_10
Related Items
Computing primitively-rooted squares and runs in partial words, Computing Primitively-Rooted Squares and Runs in Partial Words, An algorithmic toolbox for periodic partial words, Bounded hairpin completion, Efficient enumeration of non-equivalent squares in partial words with few holes