Autocorrelation and the Enumeration of Strings Avoiding a Fixed String

DOI10.1017/S0963548397002836MaRDI QIDQ3123109zbMATH OpenOpenAlexWikidataFDO

Authors Kimmo Eriksson

Publication date 6 March 1997

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548397002836

zbMATH Keywords

autocorrelationstrings

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Pattern Avoidance and Overlap in Strings
• On a Conjecture by Eriksson Concerning Overlap in Strings
• On cyclic strings avoiding a pattern
• Avoiding substrings in compositons

Cited in

(7)

• On cyclic strings avoiding a pattern
• Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
• Where and when orbits of chaotic systems prefer to go
• On a Conjecture by Eriksson Concerning Overlap in Strings
• Where to place a hole to achieve a maximal escape rate
• On cases where Litt's game is fair
• Shifts of finite type obtained by forbidding a single pattern

This page was built for publication: Autocorrelation and the Enumeration of Strings Avoiding a Fixed String

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