Two-Pattern Strings

Authors:
Frantisek Franek;Jiandong Jiang;Weilin Lu;William F. Smyth
Affiliations:
-;-;-;-
Venue:
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Year:
2002

Citing 4
Cited 0

Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
The exact number of squares in Fibonacci words

Theoretical Computer Science
Repetitions in Sturmian strings

Theoretical Computer Science
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new class of strings on {a, b}, called two-pattern strings, that constitute a substantial generalization of Sturmian strings while at the same time sharing many of their nice properties. In particular, we show that, in common with Sturmian strings, only time linear in the string length is requiredt o recognize a two-pattern string as well as to compute all of its repetitions. We also show that two-pattern strings occur in some sense frequently in the class of all strings on {a, b}.