scientific article; zbMATH DE number 2186859

zbMATH Open1071.11015MaRDI QIDQ3023976FDOQ3023976

Jan-Christoph Schlage-Puchta

Publication date: 11 July 2005

Full work available at URL: https://eudml.org/doc/51618

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Title of this publication is not available (Why is that?)

Recommendations

• Critères de non-automaticité et leurs applications
• Multiplicative functions and \(k\)-automatic sequences
• How to prove that a sequence is not automatic
• Automaticity. IV: Sequences, sets, and diversity
• On multiplicative automatic sequences

zbMATH Keywords

finite automataautomatic sequencesmultiplicative functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Automata sequences (11B85)

Cited In (10)

• Multiplicative automatic sequences
• How to prove that a sequence is not automatic
• Finite automata in number theory
• A note on multiplicative automatic sequences
• Logic and \(p\)-recognizable sets of integers
• On asymptotically automatic sequences
• Mock characters and the Kronecker symbol
• Automaticity. IV: Sequences, sets, and diversity
• A note on multiplicative automatic sequences, II
• On multiplicative automatic sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3023976)