Hostname: page-component-7dd5485656-npwhs Total loading time: 0 Render date: 2025-10-31T09:49:07.619Z Has data issue: false hasContentIssue false
  • English
  • Français

Non-commutative symbolic coding

Published online by Cambridge University Press:  11 September 2006

ROLF GOHM ,
BURKHARD KÜMMERER  and
TATJANA LANG
ROLF GOHM
Affiliation:
Department of Mathematics, University of Reading, PO Box 220, Berkshire, Reading RG6 6AX, UK (e-mail: r.gohm@reading.ac.uk)
BURKHARD KÜMMERER
Affiliation:
Fachbereich Mathematik, Technische Universität Darmstadt, Schloßgartenstr. 7, 64289 Darmstadt, Germany (e-mail: kuemmerer@mathematik.tu-darmstadt.de)
TATJANA LANG
Affiliation:
Universität Stuttgart, Mathematisches Institut A, Pfaffenwaldring 57, 70569 Stuttgart, Germany (e-mail: langta@mathematik.uni-stuttgart.de)
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 26 , Issue 5 , October 2006 , pp. 1521 - 1548
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable