Recommendations
- Automatic sequences are also non-uniformly morphic
- A generalization of automatic sequences
- Automatic Sequences
- A generalization of automatic sequences
- scientific article; zbMATH DE number 1001512
- Complexity of automatic sequences
- Complexity of automatic sequences
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Sequences of low complexity: Automatic and Sturmian sequences
- On multiplicative automatic sequences
Cites work
- scientific article; zbMATH DE number 3668011 (Why is no real title available?)
- scientific article; zbMATH DE number 3583296 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- Automatic Sequences
- Automatic sequences
- Automatic sequences are also non-uniformly morphic
- Cobham's theorem for substitutions
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Preliminaries [to: Combinatorics, words and symbolic dynamics]
- Substitutions in dynamics, arithmetics and combinatorics
- The origins of combinatorics on words
- The spectrum of dynamical systems arising from substitutions of constant length
This page was built for publication: Morphic sequences versus automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832916)
