On the Lie complexity of Sturmian words
From MaRDI portal
Publication:2089692
DOI10.1016/J.TCS.2022.10.009OpenAlexW4305057006MaRDI QIDQ2089692FDOQ2089692
Authors: Alessandro De Luca, Gabriele Fici 
Publication date: 24 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.00995
Recommendations
Cites Work
- Title not available (Why is that?)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Sequence entropy and the maximal pattern complexity of infinite words
- On a generalization of abelian equivalence and complexity of infinite words
- Powers in Sturmian sequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Cyclic complexity of words
- On the arithmetical complexity of Sturmian words
- A new complexity function for words based on periodicity
- On a new notion of complexity on infinite words
- Lie complexity of words
Cited In (7)
- A note on the Lie complexity and beyond
- On the parity slope of words of low complexity
- A lower bound for the arithmetical complexity of Sturmian words
- On the Lie complexity of Sturmian words
- On the arithmetical complexity of Sturmian words
- On the structure of bispecial Sturmian words
- Lie complexity of words
This page was built for publication: On the Lie complexity of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089692)
