The following pages link to Robert Mercaş (Q344547):
Displaying 50 items.
- A note on Thue games (Q344549) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Periodicity algorithms and a conjecture on overlaps in partial words (Q442242) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Counting bordered partial words by critical positions (Q551232) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Regular languages of partial words (Q726150) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- Erratum to: ``Avoidable binary patterns in partial words'' (Q766184) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Unbordered partial words (Q1028413) (← links)
- Corrigendum to ``A note on Thue games'' (Q1679915) (← links)
- Hide and seek with repetitions (Q1713479) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- A toolkit for Parikh matrices (Q2164742) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Freeness of partial words (Q2465643) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- The Lexicographic Cross-Section of the Plactic Monoid Is Regular (Q2849979) (← links)
- A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES (Q2856016) (← links)
- Connecting Partial Words and Regular Languages (Q2904404) (← links)
- Fine and Wilf’s Theorem and Pseudo-repetitions (Q2912765) (← links)
- k-Abelian Pattern Matching (Q2921982) (← links)
- Binary patterns in binary cube-free words: Avoidability and growth (Q2934274) (← links)
- 5-Abelian cubes are avoidable on binary alphabets (Q2934279) (← links)
- (Q2955004) (← links)
- Finding Pseudo-Repetitions (Q2957889) (← links)
- Periodicity Algorithms for Partial Words (Q3088064) (← links)
- Hairpin Lengthening and Shortening of Regular Languages (Q3166949) (← links)
- Hairpin Completion with Bounded Stem-Loop (Q3167515) (← links)
- Abelian Square-Free Partial Words (Q3564852) (← links)
- Avoidable Binary Patterns in Partial Words (Q3564853) (← links)
- How Many Holes Can an Unbordered Partial Word Contain? (Q3618579) (← links)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580) (← links)
- A note on the number of squares in a partial word with one hole (Q3653094) (← links)
- Pattern Matching with Variables (Q5053058) (← links)
- On the Prefix–Suffix Duplication Reduction (Q5217116) (← links)
- INNER PALINDROMIC CLOSURE (Q5247174) (← links)
- Circular Sequence Comparison with q-grams (Q5283829) (← links)
- Inner Palindromic Closure (Q5300837) (← links)
- 3-Abelian Cubes Are Avoidable on Binary Alphabets (Q5300855) (← links)
- (Q5306171) (← links)
