Dynamical systems and ergodic theory Symbolic dynamics Concept
Subshift of finite type
Summary
A subshift of finite type is a shift space described by a finite list of forbidden words. After a recoding of the symbols, every subshift of finite type becomes the set of bi-infinite walks on a finite directed graph. These spaces are the basic models of symbolic dynamics. Through Markov partitions they also code hyperbolic smooth systems, so questions about such systems become questions about matrices.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | 624XDXX8FN |
|---|---|
| URI | m2://624XDXX8FN |
| Kind | concept |
| Writing | W0 stub |
| MSC | 37B10 |
| Specializes | Shift space |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.