scientific article; zbMATH DE number 2186859

MaRDI QIDQ3023976zbMATH OpenFDO

Authors Jan-Christoph Schlage-Puchta

Publication date 11 July 2005

Full work available at URL https://eudml.org/doc/51618, http://www.emis.de/journals/JIS/VOL6/Puchta/puchta70.html

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

zbMATH Keywords

finite automataautomatic sequencesmultiplicative functions

Mathematics Subject Classification ID

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

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

Cited in

(13)

• A note on multiplicative automatic sequences. II
• Multiplicative automatic sequences
• How to prove that a sequence is not automatic
• Automatic sequences and parity of partition functions
• Finite automata in number theory
• A note on multiplicative automatic sequences
• Logic and p-recognizable sets of integers
• On asymptotically automatic sequences
• Critères de non-automaticité et leurs applications
• Mock characters and the Kronecker symbol
• Automaticity. IV: Sequences, sets, and diversity
• Construction of some nonautomatic sequences by cellular automata
• 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)