Subword complexity and non-automaticity of certain completely multiplicative functions
Keywords: پیچیدگی زیرزمینی; 11B85; 11N25; 68R15; Completely multiplicative functions; k-Automatic sequences; Subword complexity;