A tight upper bound on the length of maximal bordered box repetition-free words

DOI10.1007/978-3-031-34326-1_14zbMath1529.68245MaRDI QIDQ6175101

Trienko Grobler, Lynette van Zijl, Carlyle Stewart, Jean Weight

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• The origins of combinatorics on words
• Avoidable patterns in strings of symbols
• Universal cycles for combinatorial structures
• BLOCKING SETS OF TERMS
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A problem in arrangements
• Generation of Permutations by Adjacent Transposition
• Words and special factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A tight upper bound on the length of maximal bordered box repetition-free words