pith. sign in

arxiv: 1406.1754 · v1 · pith:JER52VS6new · submitted 2014-06-05 · 💻 cs.FL

Eigenvalues and Transduction of Morphic Sequences: Extended Version

classification 💻 cs.FL
keywords morphicsequencesequencestransductionalphaalpha-substitutivefactnon-erasing
0
0 comments X
read the original abstract

We study finite state transduction of automatic and morphic sequences. Dekking proved that morphic sequences are closed under transduction and in particular morphic images. We present a simple proof of this fact, and use the construction in the proof to show that non-erasing transductions preserve a condition called alpha-substitutivity. Roughly, a sequence is alpha-substitutive if the sequence can be obtained as the limit of iterating a substitution with dominant eigenvalue alpha. Our results culminate in the following fact: for multiplicatively independent real numbers alpha and beta, if v is an alpha-substitutive sequence and w is a beta-substitutive sequence, then v and w have no common non-erasing transducts except for the ultimately periodic sequences. We rely on Cobham's theorem for substitutions, a recent result of Durand.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.