Asymptotic properties of free monoid morphisms
DOI10.1016/j.laa.2016.02.030zbMath1341.68142arXiv1507.00206OpenAlexW2964341767MaRDI QIDQ272351
Julien Leroy, Michel Rigo, Émilie Charlier
Publication date: 20 April 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00206
algorithmseigenvalueasymptoticsnumeration systemCobham theoremfree monoidincidence matrix of a morphismiterated morphism
Combinatorics on words (68R15) Permutations, words, matrices (05A05) Number-theoretic algorithms; complexity (11Y16) Eigenvalues, singular values, and eigenvectors (15A18) Algebraic theory of languages and automata (68Q70) Automata sequences (11B85)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cobham's theorem for substitutions
- The growth function of \(S\)-recognizable sets
- On the simplification of infinite morphic words
- About frequencies of letters in generalized automatic sequences
- Finite automata in number theory
- Asymptotic properties of powers of nonnegative matrices, with applications
- Non-negative matrices and Markov chains. 2nd ed
- On recognizable sets of integers
- Iteration of maps by an automaton
- Logic and \(p\)-recognizable sets of integers
- A generalization of Cobham's theorem
- Generalization of automatic sequences for numeration systems on a regular language
- Some properties of substitutive words
- Morphismes unispectraux. (Unispectral morphisms)
- Hierarchie et fermeture de certaines classes de tag-systèmes
- Syndeticity and independent substitutions
- Eigenvalues and Transduction of Morphic Sequences
- Formal Languages, Automata and Numeration Systems 1
- Eulerian Polynomials: From Euler’s Time to the Present
- Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
- Automatic Sequences
- A theorem of Cobham for non-primitive substitutions
- An Introduction to Symbolic Dynamics and Coding
- Decidability of the HD0L ultimate periodicity problem
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
This page was built for publication: Asymptotic properties of free monoid morphisms