On the Lie complexity of Sturmian words

DOI10.1016/j.tcs.2022.10.009OpenAlexW4305057006MaRDI QIDQ2089692

Gabriele Fici, Alessandro De Luca

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)

Related Items (1)

A note on the Lie complexity and beyond

Cites Work

• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Cyclic complexity of words
• Powers in Sturmian sequences
• Lie complexity of words
• On the arithmetical complexity of Sturmian words
• A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Sequence entropy and the maximal pattern complexity of infinite words

This page was built for publication: On the Lie complexity of Sturmian words