The decomposition theorem for two-dimensional shifts of finite type

DOI10.1090/S0002-9939-99-04678-XzbMath0921.58012OpenAlexW1936227368MaRDI QIDQ4235564

Aimee S. A. Johnson, Kathleen Madden

Publication date: 22 March 1999

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-99-04678-x

zbMATH Keywords

decomposition theoremedge graphtextile systemstextile amalgamationstextile splittingstwo-dimensional shifts of finite type

Mathematics Subject Classification ID

Low-dimensional dynamical systems (37E99)

Related Items (13)

TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS ⋮ Finite state automata representing two-dimensional subshifts ⋮ Moves on k-graphs preserving Morita equivalence ⋮ Sofic tree-shifts ⋮ Mixing properties of tree-shifts ⋮ On graph induced symbolic systems ⋮ Tree-shifts: Irreducibility, mixing, and the chaos of tree-shifts ⋮ Tree-shifts of finite type ⋮ \(C^*\)-algebras and fell bundles associated to a textile system ⋮ Decidability of irreducible tree shifts of finite type ⋮ Optimal state amalgamation is NP-hard ⋮ Tree-shifts: the entropy of tree-shifts of finite type ⋮ Conjugacy of \(Z^2\)-subshifts and textile systems

This page was built for publication: The decomposition theorem for two-dimensional shifts of finite type