A note on the Lie complexity and beyond

DOI10.1016/j.tcs.2023.114343arXiv2207.05859MaRDI QIDQ6138836

Shuo Li

Publication date: 16 January 2024

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

Full work available at URL: https://arxiv.org/abs/2207.05859

zbMATH Keywords

automatic sequenceRauzy graphLie complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Cyclic complexity of words
• k-optimal partitions of a directed graph
• On the Lie complexity of Sturmian words
• Lie complexity of words
• Generalized Parikh mappings and homomorphisms
• On the Complexity of Finite Sequences
• Automatic Sequences
• Enumeration and Decidable Properties of Automatic Sequences

This page was built for publication: A note on the Lie complexity and beyond