On Lambda-Graph Systems for Subshifts of Subshifts

Simple item page
dc.creatorKrieger, Wolfgang
dc.date2005-09-21
dc.date2006-12-30
dc.date.accessioned2026-07-07T07:37:33Z
dc.date.available2026-07-07T07:37:33Z
dc.descriptionKengo Matsumoto has introduced lambda-graph systems and strong shift equivalence of lambda-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a lambda-graph system. The strong shift equivalence class of the associated lambda-graph system is an invariant of subsystem equivalence. Wolfgang Krieger and Kengo Matsumoto have introduced the lambda$-entropy of a lambda-graph system and have shown its invariance under strong shift equivalence [Ergod.Th.&Dynam.Sys. 24 (2004) 1155 - 1172]. A separation entropy of a subshift of a subshift is introduced as the lambda-entropy of the associated lambda-graph system.
dc.description11 pages, minor changes
dc.identifierhttps://arxiv.org/abs/math/0509466
dc.identifierhttp://arxiv.org/abs/math/0509466
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120815
dc.subjectDynamical Systems
dc.subject37B10
dc.titleOn Lambda-Graph Systems for Subshifts of Subshifts
dc.typetext

Files

Collections

arXiv