Pattern Avoidance and Overlap in Strings

DOI10.1017/S0963548302005187MaRDI QIDQ3146987zbMATH OpenFDO

Authors Marianne Månsson

Publication date 2002

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

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

zbMATH Keywords

finite alphabet

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 6003273
• On cyclic strings avoiding a pattern
• String pattern avoidance in generalized non-crossing trees
• Finding approximate patterns in strings
• Periodicity and repetitions in parameterized strings
• Pattern avoidance by palindromes
• Algorithmic Learning Theory
• Combinatorics of periods in strings.
• Avoidability of palindrome patterns

Cited in

(7)

• On cyclic strings avoiding a pattern
• Avoiding substrings in compositons
• Autocorrelation and the Enumeration of Strings Avoiding a Fixed String
• 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

This page was built for publication: Pattern Avoidance and Overlap in Strings

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