(non)-automaticity of completely multiplicative sequences having negligible many non-trivial prime factors

2017/08/02 by Shuo Li, Li, Shuo
Computer Science · #semigroups and automata theory #Computability, Logic, AI Algorithms #Cellular Automata and Applications

paper · pdf · doi:10.48550/arxiv.1708.04265

Abstract

In this article we consider the completely multiplicative sequences (a_n)_{n ∈ N} defined on a field K and satisfying ∑_{p| p ≤ n, ap ≠ 1, p ∈ P}(1)/(p)

Related

• Subword Complexity and (non)-automaticity of certain completely multiplicative functions
• On completely multiplicative automatic sequences
• On multiplicative automatic sequences
• A note on multiplicative automatic sequences
• Multiplicative generalised polynomial sequences