Pages that link to "Item:Q5310364"
From MaRDI portal
The following pages link to Algorithmic Combinatorics on Partial Words (Q5310364):
Displayed 50 items.
- Computing covers using prefix tables (Q313747) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Regular languages of partial words (Q726150) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- Weak containment for partial words is coNP-complete (Q894455) (← links)
- Border correlations of partial words (Q987385) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- On the state complexity of partial word DFAs (Q2344741) (← links)
- Computing minimum length representations of sets of words of uniform length (Q2355702) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- Squares in partial words (Q2440165) (← links)
- Recurrence in infinite partial words (Q2637347) (← links)
- Border Correlations, Lattices, and the Subgraph Component Polynomial (Q2946042) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS (Q3056274) (← links)
- Squareable Words (Q3451095) (← links)
- REMARKS ON TWO NONSTANDARD VERSIONS OF PERIODICITY IN WORDS (Q3606559) (← links)
- How Many Holes Can an Unbordered Partial Word Contain? (Q3618579) (← links)
- On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
- A note on the number of squares in a partial word with one hole (Q3653094) (← links)
- IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences (Q4639924) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- (Q5016356) (← links)
- Watson-Crick Partial Words (Q5055986) (← links)