Non-commutative symbolic coding

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Gohm, R., Kummerer, B. and Lang, T. (2006) Non-commutative symbolic coding. Ergodic Theory and Dynamical Systems, 26. pp. 1521-1548. ISSN 0143-3857

Abstract/Summary

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.

Additional Information Part 5
Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/4910
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Uncontrolled Keywords W-STAR-ALGEBRAS SCATTERING-THEORY MARKOV-CHAINS
Additional Information Part 5
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar