A weak equivalence between shifts of finite type

DOI10.1016/S0196-8858(02)00004-0MaRDI QIDQ1865259zbMATH OpenFDO

Authors Marie-Pierre Béal, Dominique Perrin

Publication date 26 March 2003

Published in Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalenceshift of finite typecircular codes

Mathematics Subject Classification ID

Symbolic dynamics (37B10)

Recommendations

• Weak equivalence for shifts of finite type
• Flow equivalence of shifts of finite type via positive factorizations.
• scientific article; zbMATH DE number 177175
• scientific article; zbMATH DE number 952657
• Algebraic aspects of symbolic dynamics

Cites work

• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• An Introduction to Symbolic Dynamics and Coding

Cited in

(5)

• Weak isomorphisms between Bernoulli shifts
• Is Every Irreducible Shift of Finite Type Flow Equivalent to a Renewal System?
• A technical note on weak shift equivalence
• A new algebraic invariant for weak equivalence of sofic subshifts
• Weak equivalence for shifts of finite type

This page was built for publication: A weak equivalence between shifts of finite type

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