Counting Lyndon factors
From MaRDI portal
Publication:2401409
zbMath1375.68095arXiv1701.00928MaRDI QIDQ2401409
W. F. Smyth, Amy Glen, R. Jamie Simpson
Publication date: 8 September 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.00928
Related Items (2)
Computing longest (common) Lyndon subsequences ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences
Cites Work
- Unnamed Item
- Unnamed Item
- Lyndon words and Fibonacci numbers
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Factorizing words over an ordered alphabet
- Sturmian and Episturmian Words
- Determination of [nθ by its Sequence of*Differences]
- Descriptions of the Characteristic Sequence of an Irrational
- On Sturmian and episturmian words, and related topics
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Counting Lyndon factors
