On the Lie complexity of Sturmian words

DOI10.1016/J.TCS.2022.10.009MaRDI QIDQ2089692zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Sturmian wordLie complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Cyclic complexity of words
• Cyclic Complexity of Words
• On the arithmetical complexity of Sturmian words
• *-Sturmian words and complexity
• Periodic and Sturmian languages

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A new complexity function for words based on periodicity
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Cyclic complexity of words
• Lie complexity of words
• On a generalization of abelian equivalence and complexity of infinite words
• On a new notion of complexity on infinite words
• On the arithmetical complexity of Sturmian words
• Powers in Sturmian sequences
• Sequence entropy and the maximal pattern complexity of infinite 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 arithmetical complexity of Sturmian words
• On the Lie 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)