On Lambda-Graph Systems for Subshifts of Subshifts
classification
🧮 math.DS
keywords
lambda-graphequivalencesubshiftsystemintroducedshiftstrongsystems
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.