Lie complexity of words

DOI10.1016/j.tcs.2022.06.001OpenAlexW4281647486MaRDI QIDQ2163386

Jason P. Bell, Jeffrey O. Shallit

Publication date: 10 August 2022

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

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

zbMATH Keywords

automatic sequencescombinatorics on wordsmorphic wordsLie complexitylinear factor complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Topological invariants for words of linear factor complexity ⋮ A note on the Lie complexity and beyond ⋮ On the Lie complexity of Sturmian words

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for enumerating all infinite repetitions in a D0L-system
• Cyclic complexity of words
• A dichotomy result for prime algebras of Gelfand-Kirillov dimension two.
• Complexity and special factors
• Avoidability of circular formulas
• Infinite words with linear subword complexity
• The prime spectrum of algebras of quadratic growth.
• Abelian complexity of minimal subshifts
• Avoiding conjugacy classes on the 5-letter alphabet
• Mechanical Proofs of Properties of the Tribonacci Word
• Repetitions in the Fibonacci infinite word
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Iterative algebras.

This page was built for publication: Lie complexity of words