Two-pattern strings. II: Frequency of occurrence and substring complexity

DOI10.1016/J.JDA.2006.04.002zbMATH Open1156.68044OpenAlexW2015957628MaRDI QIDQ925072FDOQ925072

Authors: Frantisek Franek, Jiandong Jiang, W. F. Smyth 

Publication date: 29 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.jda.2006.04.002

Recommendations

• scientific article; zbMATH DE number 2087045
• Two-pattern strings. I: A recognition algorithm
• scientific article; zbMATH DE number 1336330
• Repetitions in Sturmian strings
• Pattern spectra, substring enumeration, and automatic sequences

zbMATH Keywords

complexityfrequencyperiodicitystringSturmiantwo-pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Periods in strings
• Repetitions in Sturmian strings
• Two-pattern strings. I: A recognition algorithm
• SORTING SUFFIXES OF TWO-PATTERN STRINGS

Cited In (4)

• Title not available (Why is that?)
• Strings with maximally many distinct subsequences and substrings
• SORTING SUFFIXES OF TWO-PATTERN STRINGS
• Two-pattern strings. I: A recognition algorithm

This page was built for publication: Two-pattern strings. II: Frequency of occurrence and substring complexity

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