Non-commutative symbolic coding

Rolf Gohm, Burkhard Kuemmerer, Tatjana Lang

Research output: Contribution to journalArticlepeer-review

7 Citations (SciVal)

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 languageEnglish
Pages (from-to)1521-1548
Number of pages28
JournalErgodic Theory and Dynamical Systems
Volume26
Issue number5
Early online date11 Sept 2006
DOIs
Publication statusPublished - 01 Oct 2006

Fingerprint

Dive into the research topics of 'Non-commutative symbolic coding'. Together they form a unique fingerprint.

Cite this