Minimal non-convex words

DOI10.1016/J.TCS.2010.06.025zbMath1225.05013OpenAlexW2068170894MaRDI QIDQ544886

Xavier Provençal

Publication date: 16 June 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.025

zbMATH Keywords

Christoffel wordsLyndon wordsdiscrete convexitybalanced wordsstandard factorization

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Polyominoes (05B50)

Related Items (1)

Longest Lyndon Substring After Edit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Lyndon + Christoffel = digitally convex
• Certain words on the real projective line
• Some combinatorial properties of Sturmian words
• Sturmian words, Lyndon words and trees
• Balanced words
• Combinatorics on Words
• Uniqueness Theorems for Periodic Functions
• Sequences with minimal block growth

This page was built for publication: Minimal non-convex words