A new algebraic invariant for weak equivalence of sofic subshifts

DOI10.1051/ITA:2008015MaRDI QIDQ3526413zbMATH OpenOpenAlexFDO

Authors Laura Chaubard, Alfredo Costa

Publication date 25 September 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92884, https://semanticscholar.org/paper/ec35390d737fbd6d8239cf3bb91d133cdb87e96f

zbMATH Keywords

conjugacyweak equivalencepseudovarieties of finite semigroupssofic subshift\(\zeta\)-semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Symbolic dynamics (37B10) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• An invariant for bounded-to-one factor maps between transitive sofic subshifts
• A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
• An algorithm for sofic shift equivalence
• Weak equivalence to Bernoulli shifts for some algebraic actions
• Sofic subshifts and piecewise isometric systems
• Sofic Constant-to-One Extensions of Subshifts of Finite Type
• On some new invariants for shift equivalence for shifts of finite type
• A class of invariants of the topological conjugacy of subshifts
• Lattice invariants for sofic shifts
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY

Cites work

• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 4085971 (Why is no real title available?)
• scientific article; zbMATH DE number 53371 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• A hierarchy of shift equivalent sofic shifts
• A weak equivalence between shifts of finite type
• An Introduction to Symbolic Dynamics and Coding
• Endomorphisms and automorphisms of the shift dynamical system
• Minimal automaton for a factorial, transitive, and rational language
• On sofic systems. I
• Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
• Sofic systems and graphs
• Systèmes codés. (Coded systems)
• THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
• Topological conjugacy for sofic systems
• Wreath product and infinite words

Cited in

(2)

• An invariant for bounded-to-one factor maps between transitive sofic subshifts
• Weak equivalence for shifts of finite type

This page was built for publication: A new algebraic invariant for weak equivalence of sofic subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526413)