On Lambda-Graph Systems for Subshifts of Subshifts

Details On Lambda-Graph Systems for Subshifts of Subshifts On Lambda-Graph Systems for Subshifts of Subshifts

2005-09-21

arxiv.org/abs/math/0509466v2

Mathematics

Dynamical Systems

11 pages, minor changes

Scientific paper

Kengo 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.

Affiliated with

Also associated with

No associations

Rating

On Lambda-Graph Systems for Subshifts of Subshifts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Lambda-Graph Systems for Subshifts of Subshifts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Lambda-Graph Systems for Subshifts of Subshifts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486480