Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences

DOI10.1007/978-3-642-37064-9_28zbMath1377.68192arXiv1207.5124OpenAlexW2963407000MaRDI QIDQ4910468

Daniel Goč, Kalle Saari, Jeffrey O. Shallit

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

automatic sequenceprimitive wordLyndon wordLyndon factorizationlinearly recurrent sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (5)

Mechanical Proofs of Properties of the Tribonacci Word ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Lyndon words and Fibonacci numbers ⋮ Additive number theory via automata theory ⋮ Unnamed Item

This page was built for publication: Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences