Two-pattern strings. I: A recognition algorithm

DOI10.1016/S1570-8667(03)00037-6MaRDI QIDQ1827270zbMATH OpenFDO

Authors Frantisek Franek, Weilin Lu, W. F. Smyth

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)

Recommendations

• scientific article; zbMATH DE number 2087045
• Two-pattern strings. II: Frequency of occurrence and substring complexity
• Repetitions in Sturmian strings
• SORTING SUFFIXES OF TWO-PATTERN STRINGS
• scientific article; zbMATH DE number 3913712

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A characterization of the squares in a Fibonacci string
• A fast string searching algorithm
• A linear algorithm for nonhomogeneous spectra of numbers
• A universal algorithm for sequential data compression
• Detecting leftmost maximal periodicities
• On the Complexity of Finite Sequences
• Repetitions in Sturmian strings

Cited in

(8)

• Weak repetitions in Sturmian strings.
• Pattern discovery in colored strings
• Pattern discovery in colored strings
• scientific article; zbMATH DE number 2087045 (Why is no real title available?)
• Repetitions in Sturmian strings
• A new approach to regular \& indeterminate strings
• SORTING SUFFIXES OF TWO-PATTERN STRINGS
• Two-pattern strings. II: Frequency of occurrence and substring complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827270)