2005/09/21 by Wolfgang Krieger, Krieger, Wolfgang
Computer Science · Engineering · Mathematics · #37B10 #Cellular Automata and Applications #Dynamical Systems (math.DS) #FOS: Mathematics #graph theory and CDMA systems #math.DS #msc:37B10 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0509466
11 pages, minor changes
openalex publication_date 2005/09/21 · arxiv created 2006/12/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.