Algorithmic Combinatorics on Partial Words
From MaRDI portal
Publication:5310364
DOI10.1201/9781420060935zbMATH Open1180.68205OpenAlexW2016376081MaRDI QIDQ5310364FDOQ5310364
Authors: F. Blanchet-Sadri 
Publication date: 11 October 2007
Full work available at URL: https://doi.org/10.1201/9781420060935
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics on words (68R15)
Cited In (60)
- Some combinatorial results on pcodes
- IDPM: an improved degenerate pattern matching algorithm for biological sequences
- Watson-Crick Partial Words
- Unavoidable sets of partial words of uniform length
- REMARKS ON TWO NONSTANDARD VERSIONS OF PERIODICITY IN WORDS
- Abelian repetitions in partial words
- On the state complexity of partial word DFAs
- Computing the partial word avoidability indices of binary patterns
- Computing the partial word avoidability indices of ternary patterns
- On minimal Sturmian partial words
- Algorithmic combinatorics on partial words
- Regular languages of partial words
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- Avoidable binary patterns in partial words
- State complexity of finite partial languages
- On the number of squares in partial words
- How Many Holes Can an Unbordered Partial Word Contain?
- The three-squares lemma for partial words with one hole
- Word Problems and Membership Problems on Compressed Words
- Avoiding large squares in partial words
- Title not available (Why is that?)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
- Constructing partial words with subword complexities not achievable by full words
- Computing regularities in strings: a survey
- Recurrence in infinite partial words
- Streaming pattern matching with \(d\) wildcards
- An algorithmic toolbox for periodic partial words
- Number of holes in unavoidable sets of partial words. I.
- An account of speciality of partial words with respect to periodicity
- Computing covers using prefix tables
- On the complexity of deciding avoidability of sets of partial words
- Fine and Wilf's theorem for partial words with arbitrarily many weak periods
- Conjugacy on partial words.
- Unavoidable sets of partial words
- Indeterminate strings, prefix arrays \& undirected graphs
- Squares and primitivity in partial words
- A note on the number of squares in a partial word with one hole
- State complexity of finite partial languages
- Weak containment for partial words is coNP-complete
- Border correlations of partial words
- Combinatorics on partial word correlations
- Title not available (Why is that?)
- Border correlations, lattices, and the subgraph component polynomial
- Computing primitively-rooted squares and runs in partial words
- Border correlations, lattices, and the subgraph component polynomial
- Minimum number of holes in unavoidable sets of partial words of size three
- Computing generalized de Bruijn sequences
- Periods in partial words: an algorithm
- Avoiding Abelian squares in partial words
- A new approach to regular \& indeterminate strings
- Squareable words
- A note on the longest common compatible prefix problem for partial words
- Algebraic combinatorics on words. With preface by Jean Berstel and Dominique Perrin.
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- A prefix array for parameterized strings
- Computing minimum length representations of sets of words of uniform length
- Inferring an indeterminate string from a prefix graph
- Squares in partial words
- Abelian-primitive partial words
- State complexity of partial word finite automata
This page was built for publication: Algorithmic Combinatorics on Partial Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310364)
