Finite automata and arithmetic

zbMath0903.11009MaRDI QIDQ1382882

Jean-Paul Allouche

Publication date: 24 March 1998

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

surveybibliographytranscendenceautomatic sequencesfinite automatasubstitutionpaperfolding sequenceProuhet-Thue-Morse sequenceRudin-Shapiro sequenceBaum-Sweet sequenceCarlitz zeta-functionformed power seriesHanoi sequenceuniform tag system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Drinfel'd modules; higher-dimensional motives, etc. (11G09) Transcendence (general theory) (11J81) Automata sequences (11B85)

Related Items (3)

On maximal autocorrelations of Rudin-Shapiro sequences ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Unnamed Item

This page was built for publication: Finite automata and arithmetic