Automata and differentiable words

DOI10.1016/J.TCS.2012.03.033MaRDI QIDQ442244zbMATH OpenOpenAlexFDO

Authors Gabriele Fici, Jean-Marc Fédou

Publication date 10 August 2012

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

Full work available at URL https://doi.org/10.1016/j.tcs.2012.03.033

zbMATH Keywords

automata\(\mathbf C^\infty\)-wordsforbidden wordsKolakoski word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the number of \(C^{\infty}\)-words of each length
• Vertical representation of \(\mathbf{C}^\infty\)-words
• scientific article; zbMATH DE number 1112371
• scientific article; zbMATH DE number 3956447
• scientific article; zbMATH DE number 800168

Cites work

• scientific article; zbMATH DE number 3739694 (Why is no real title available?)
• scientific article; zbMATH DE number 1064716 (Why is no real title available?)
• scientific article; zbMATH DE number 1995126 (Why is no real title available?)
• scientific article; zbMATH DE number 1998341 (Why is no real title available?)
• A note on differentiable palindromes.
• Automata and forbidden words
• Combinatorial properties of smooth infinite words
• ON THE REPETITIVITY INDEX OF INFINITE WORDS
• On a word avoiding near repeats
• On repeated factors in \(C^\infty\)-words
• On the number of \(C^{\infty}\)-words of each length
• Vertical representation of \(\mathbf{C}^\infty\)-words

Cited in

(2)

• Automata and forbidden words
• Vertical representation of \(\mathbf{C}^\infty\)-words

This page was built for publication: Automata and differentiable words

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