scientific article

zbMath0472.10054MaRDI QIDQ3926698

F. Michel Dekking

Publication date: 1981

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

subword complexitynumber of words of finite lengthselfgenerating sequence

Mathematics Subject Classification ID

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

Related Items (11)

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

This page was built for publication: