Journal of Integer Sequences, Vol. 23 (2020), Article 20.10.8

Two Infinite Words with Cubic Subword Complexity


Luke Schaeffer
Institute for Quantum Computing
University of Waterloo
Waterloo, ON N2L 3G1
Canada

Kaiyu Wu
School of Computer Science
University of Waterloo
Waterloo, ON N2L 3G1
Canada

Abstract:

We consider two natural infinite words whose subword complexity is cubic, and determine their exact subword complexity. As a consequence, it follows that neither word is morphic.

Full version:  pdf,    dvi,    ps,    latex    

(Concerned with sequences A338760 A338761.)

Received September 10 2020; revised version received October 27 2020. Published in Journal of Integer Sequences, November 7 2020.

Return to Journal of Integer Sequences home page