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 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Boshernitzan & Aviezri S. Fraenkel, A linear algorithm for nonhomogeneous spectra of numbers, J. Algorithms 5 (1984) 187–198.
Maxime Crochemore, An optimal algorithm for computing the repetitions in a word, IPL 12-5 (1981) 244–250.
Martin Farach, Optimal suffix tree construction with large alphabets, Proc. 38th Annual IEEE Symp. FOCS (1997) 137–143.
Aviezri S. Fraenkel & R. Jamie Simpson, The exact number of squares in Fibonacci words, TCS 218-1 (1999) 83–94.
František Franěk, Ayşe Karaman & W. F. Smyth, Repetitions in Sturmian strings, TCS 249-2 (2000) 289–303.
Leo J. Guibas & Andrew M. Odlyzko, Periods in strings, J. Combinatorial Theory, Series A 30 (1981) 19–42.
Costas S. Iliopoulos, Dennis Moore & W. F. Smyth, A characterization of the squares in a Fibonacci string, TCS 172 (1997) 281–291.
Roman Kolpakov & Gregory Kucherov, On maximal repetitions in words, J. Discrete Algorithms 1 (2000) 159–186.
Abraham Lempel & Jacob Ziv, On the complexity of finite sequences, IEEE Trans. Information Theory 22 (1976) 75–81.
Michael G. Main, Detecting leftmost maximal periodicities, Discrete Applied Maths. 25 (1989) 145–153.
Jacob Ziv & Abraham Lempel, A universal algorithm for sequential data compression, IEEE Trans. Information Theory 23 (1977) 337–343.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franěk, F., Jiang, J., Lu, W., Smyth, W.F. (2002). Two-Pattern Strings. In: Apostolico, A., Takeda, M. (eds) Combinatorial Pattern Matching. CPM 2002. Lecture Notes in Computer Science, vol 2373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45452-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-45452-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43862-5
Online ISBN: 978-3-540-45452-6
eBook Packages: Springer Book Archive