Look and Say Fibonacci

DOI10.1051/ITA:2007060MaRDI QIDQ3537494zbMATH OpenOpenAlexFDO

Authors Patrice Séébold

Publication date 7 November 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/246029

zbMATH Keywords

binary wordsConwayFibonacci wordlook and say sequenceLyndon factorizationmorphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 36117
• Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
• scientific article; zbMATH DE number 3947643
• scientific article; zbMATH DE number 4132165
• scientific article; zbMATH DE number 1111405

Cites work

• A remark on morphic sturmian words
• Automatic Sequences
• Combinatorial properties of smooth infinite words
• Hierarchie et fermeture de certaines classes de tag-systèmes
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 1333603 (Why is no real title available?)
• scientific article; zbMATH DE number 2068881 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3028781 (Why is no real title available?)
• Infinite Lyndon words
• Lyndon factorization of Sturmian words
• Mots sans carre et morphismes iterés
• On morphisms preserving infinite {L}yndon words
• On the conjugation of standard morphisms
• Uniform tag sequences

Cited in

(1)

• scientific article; zbMATH DE number 2124073 (Why is no real title available?)

This page was built for publication: Look and Say Fibonacci

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537494)