The following pages link to Sean Simmons (Q645978):
Displaying 16 items.
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- Erratum to: ``Avoidable binary patterns in partial words'' (Q766184) (← links)
- Deciding representability of sets of words of equal length (Q1939274) (← links)
- Counting minimal semi-Sturmian words (Q2446875) (← links)
- Abelian pattern avoidance in partial words (Q2874640) (← links)
- Abelian Pattern Avoidance in Partial Words (Q2912721) (← links)
- (Q3018955) (← links)
- Deciding Representability of Sets of Words of Equal Length (Q3167575) (← links)
- Abelian Square-Free Partial Words (Q3564852) (← links)
- Avoidable Binary Patterns in Partial Words (Q3564853) (← links)
- Algebraic Cryptanalysis of Simplified AES∗ (Q3644987) (← links)
- Avoiding Abelian Powers in Partial Words (Q5199954) (← links)
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf (Q5397716) (← links)
- Computing Depths of Patterns (Q5404910) (← links)
