On the number of words containing the factor (aba)^k

DOI10.1016/J.DAM.2007.02.009zbMATH Open1178.68387OpenAlexW2038510059MaRDI QIDQ997077FDOQ997077

Authors: Ioan Tomescu 

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.009

Recommendations

• scientific article; zbMATH DE number 2182450
• Threshold properties of some periodic factors of words over a finite alphabet
• On the number of occurrences of all short factors in almost all words.
• scientific article; zbMATH DE number 1156874
• Avoidability of long \(k\)-abelian repetitions

zbMATH Keywords

characteristic equationrecurrence relationfactorwordpseudo-Vandermonde determinant

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Deviations from uniformity in random strings
• String overlaps, pattern matching, and nontransitive games
• Title not available (Why is that?)
• Title not available (Why is that?)
• On words containing all short subwords
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Threshold properties of some periodic factors of words over a finite alphabet
• On the number of occurrences of all short factors in almost all words.
• On fragments of words
• On the average number of regularities in a word
• Title not available (Why is that?)

This page was built for publication: On the number of words containing the factor \((aba)^k\)

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