Embedding subshifts of finite type into the Fibonacci–Dyck shift
From MaRDI portal
Publication:4600263
Abstract: A necessary and sufficient condition is given for the existence of an embedding of an irreducible subshift of finite type into the Fibonacci-Dyck shift
Cites work
- scientific article; zbMATH DE number 1565063 (Why is no real title available?)
- scientific article; zbMATH DE number 3328203 (Why is no real title available?)
- A construction of subshifts and a class of semigroups
- An Introduction to Symbolic Dynamics and Coding
- Codes and automata.
- Embedding of shifts of finite type into the Dyck shift
- On a syntactically defined invariant of symbolic dynamics
- On the uniqueness of the equilibrium state
- Subsystems of finite type and semigroup invariants of subshifts
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- The origins of combinatorics on words
- Zeta functions and topological entropy of the Markov-Dyck shifts
- \(C^\ast\)-algebras arising from Dyck systems of topological Markov chains
Cited in
(2)
This page was built for publication: Embedding subshifts of finite type into the Fibonacci–Dyck shift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600263)