scientific article; zbMATH DE number 3739694

MaRDI QIDQ3926698zbMATH OpenFDO

Authors F. Michel Dekking

Publication date 1981

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

zbMATH Keywords

number of words of finite lengthselfgenerating sequencesubword complexity

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Formal languages and automata (68Q45)

Cited in

(12)

• On the number of \(C^{\infty}\)-words of each length
• On repeated factors in \(C^\infty\)-words
• A note on differentiable palindromes.
• Smooth words on 2-letter alphabets having same parity
• Smooth words over arbitrary alphabets
• Automata and differentiable words
• Vertical representation of \(\mathbf{C}^\infty\)-words
• Iterative devices generating infinite words
• The complexity of smooth words on 2-letter alphabets
• The reflection complexity of sequences over finite alphabets
• A note on the complexity of \(C^{\infty }\)-words
• Combinatorial properties of smooth infinite words

This page was built for publication:

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