A note on multiplicative automatic sequences, II
From MaRDI portal
Publication:5110611
DOI10.1112/blms.12318zbMath1457.11023arXiv1905.10897OpenAlexW2936719614WikidataQ126306140 ScholiaQ126306140MaRDI QIDQ5110611
Publication date: 21 May 2020
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10897
Combinatorics on words (68R15) Automata sequences (11B85) Other results on the distribution of values or the characterization of arithmetic functions (11N64)
Related Items (3)
How to prove that a sequence is not automatic ⋮ Automatic sequences are orthogonal to aperiodic multiplicative functions ⋮ Multiplicative automatic sequences
Cites Work
- Unnamed Item
- (Non)Automaticity of number theoretic functions
- Subword complexity and non-automaticity of certain completely multiplicative functions
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Multiplicative functions and \(k\)-automatic sequences
- Mock characters and the Kronecker symbol
- A note on multiplicative automatic sequences
- THE MINIMAL GROWTH OF A -REGULAR SEQUENCE
- Completely Multiplicative Automatic Functions
- Transcendence of generating functions whose coefficients are multiplicative
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- Suites algébriques, automates et substitutions
- Automatic Sequences
- HARMONIC ANALYSIS ON THE POSITIVE RATIONALS. DETERMINATION OF THE GROUP GENERATED BY THE RATIOS
- Correlations of multiplicative functions and applications
- On multiplicative automatic sequences
This page was built for publication: A note on multiplicative automatic sequences, II