On Subword Complexity of Morphic Sequences

DOI10.1007/978-3-540-79709-8_17zbMath1142.68464arXiv1502.02310OpenAlexW2153578201MaRDI QIDQ3503634

Rostislav Deviatov

Publication date: 5 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

On the joint subword complexity of automatic sequences ⋮ On the permutation complexity of the Cantor-like sequences

This page was built for publication: On Subword Complexity of Morphic Sequences