Abelian complexity function of the Tribonacci word

zbMath1311.68128arXiv1309.4810MaRDI QIDQ5246244

Ondřej Turek

Publication date: 20 April 2015

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

zbMATH Keywords

finite automatonTribonacci wordabelian complexity4-Bonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (6)

Mechanical Proofs of Properties of the Tribonacci Word ⋮ Abelian Complexity and Synchronization ⋮ Abelian combinatorics on words: a survey ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ Relations on words ⋮ On infinite prefix normal words

Uses Software

• OEIS

This page was built for publication: Abelian complexity function of the Tribonacci word