Two-pattern strings. I: A recognition algorithm

DOI10.1016/S1570-8667(03)00037-6zbMath1077.68083MaRDI QIDQ1827270

Frantisek Franek, W. F. Smyth, Weilin Lu

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

SturmianStringLinearRecognition algorithmTwo-pattern

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (2)

Two-pattern strings. II: Frequency of occurrence and substring complexity ⋮ SORTING SUFFIXES OF TWO-PATTERN STRINGS

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of the squares in a Fibonacci string
• Repetitions in Sturmian strings
• Detecting leftmost maximal periodicities
• A fast string searching algorithm
• A linear algorithm for nonhomogeneous spectra of numbers
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression

This page was built for publication: Two-pattern strings. I: A recognition algorithm