Automatic complexity of Fibonacci and tribonacci words

DOI10.1016/j.dam.2020.10.014zbMath1477.68134arXiv2010.07275OpenAlexW3095808584MaRDI QIDQ2217496

Bjørn Kjos-Hanssen

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Fibonacci wordnondeterministic automatic complexitytribonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Unnamed Item

Uses Software

• GitHub
• tetranacci

Cites Work

• Unnamed Item
• Unnamed Item
• Nondeterministic automatic complexity of overlap-free and almost square-free words
• Automatic complexity of shift register sequences
• On the complexity of automatic complexity
• On cube-free \(\omega\)-words generated by binary morphisms
• Some properties of the Tribonacci sequence
• Powers in a class of \(\mathcal A\)-strict standard episturmian words
• Repetitions in the Fibonacci infinite word
• Few Paths, Fewer Words: Model Selection With Automatic Structure Functions

This page was built for publication: Automatic complexity of Fibonacci and tribonacci words