Morphic sequences versus automatic sequences
From MaRDI portal
Publication:832916
DOI10.1007/978-3-030-81508-0_1OpenAlexW3191323627MaRDI QIDQ832916FDOQ832916
Authors: Jean-Paul Allouche
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_1
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic Sequences
- Cobham's theorem for substitutions
- The spectrum of dynamical systems arising from substitutions of constant length
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Automatic sequences
- The origins of combinatorics on words
- Title not available (Why is that?)
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Title not available (Why is that?)
- Automatic sequences are also non-uniformly morphic
- Preliminaries [to: Combinatorics, words and symbolic dynamics]
Cited In (2)
Uses Software
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)