2009/10/25 by Wolfgang Krieger, Krieger, Wolfgang, Kengo Matsumoto +1
Computer Science · #37B10 #46L80 #68Q45 #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Operator Algebras (math.OA) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0910.4719
openalex publication_date 2009/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological conjugacy and flow equivalence of standard one-counter shifts. To subshifts there are associated C*-algebras by their λ-graph systems. We describe a class of standard one-counter shifts with the property that the C*-algebra associated to them is simple, while the C*-algebra that is associated to their inverse is not. This gives examples of subshifts that are not flow equivalent to their inverse. For a family of highly structured standard one-counter shifts we compute the K-groups.