Morphic sequences versus automatic sequences

DOI10.1007/978-3-030-81508-0_1OpenAlexW3191323627MaRDI QIDQ832916

Jean-Paul Allouche

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_1

zbMATH Keywords

automatic sequencescombinatorics on wordsmorphic sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cobham's theorem for substitutions
• Substitutions in dynamics, arithmetics and combinatorics
• The origins of combinatorics on words
• Automatic sequences
• Automatic sequences are also non-uniformly morphic
• The spectrum of dynamical systems arising from substitutions of constant length
• Automatic Sequences
• Preliminaries
• Formal Languages, Automata and Numeration Systems 2

This page was built for publication: Morphic sequences versus automatic sequences