Abstract
We give a non-commutative generalization of classical symbolic coding in the presence of a synchronizing word. This is done by a scattering theoretical approach. Classically, the existence of a synchronizing word turns out to be equivalent to asymptotic completeness of the corresponding Markov process. A criterion for asymptotic completeness in general is provided by the regularity of an associated extended transition operator. Commutative and non-commutative examples are analysed.
Original language | English |
---|---|
Pages (from-to) | 1521-1548 |
Number of pages | 28 |
Journal | Ergodic Theory and Dynamical Systems |
Volume | 26 |
Issue number | 5 |
Early online date | 11 Sept 2006 |
DOIs | |
Publication status | Published - 01 Oct 2006 |