Abstract
In this chapter, we study a special case of automata, called bijective automata, whose instructions are permutations of the letters of A, including the case of additionally commutative automata in the previous sense. In order to describe the measures generating the maximal spectral type, we investigate the structure of the associated system with a new viewpoint. In the commutative bijective case, we give a complete description of those measures, and we touch on the spectral multiplicity problem which will be discussed later. In the non-commutative case, we only succeed in exhibiting strongly mixing generating measures. Note that the sequences arising from bijective substitutions are related to generalized Morse sequences studied in [156, 175, 176].
Keywords
- Initial System
- Constant Length
- Unique Code
- Abelian Case
- Unique Ergodicity
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Queffélec, M. (2010). Bijective Automata. In: Substitution Dynamical Systems - Spectral Analysis. Lecture Notes in Mathematics(), vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11212-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-11212-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11211-9
Online ISBN: 978-3-642-11212-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
