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 required to 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}.
Supported in part by grants from the Natural Sciences & Engineering Research Council of Canada.