|
|
|
|
| LEADER |
02864nmm a2200325 u 4500 |
| 001 |
EB000666540 |
| 003 |
EBX01000000000000000519622 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642588228
|
| 100 |
1 |
|
|a Kitchens, Bruce P.
|
| 245 |
0 |
0 |
|a Symbolic Dynamics
|h Elektronische Ressource
|b One-sided, Two-sided and Countable State Markov Shifts
|c by Bruce P. Kitchens
|
| 250 |
|
|
|a 1st ed. 1998
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1998, 1998
|
| 300 |
|
|
|a X, 254 p. 2 illus
|b online resource
|
| 505 |
0 |
|
|a 1. Background and Basics -- § 1.1 Subshifts of Finite Type -- § 1.2 Examples -- § 1.3 Perron-Frobenius Theory -- § 1.4 Basic Dynamics -- Notes -- References -- 2. Topology Conjugacy -- § 2.1 Decomposition of Topological Conjugacies -- § 2.2 Algebraic Consequences of Topological Conjugacy -- Notes -- References -- 3. Automorphisms -- § 3.1 Automorphisms -- § 3.2 Automorphisms as Conjugacies -- § 3.3 Subgroups of the Automorphism Group -- § 3.4 Actions of Automorphisms -- § 3.5 Summary -- Notes -- References -- 4. Embeddinggs and Factor Maps -- § 4.1 Factor Maps -- § 4.2 Finite-to-one Factor Maps -- §4.3 Special Constructions Involving Factor Maps -- § 4.4 Subsystems and Infinite-to-One Factor Maps -- Notes -- References -- 5. Almost-Topological Conjugacy -- § 5.1 Reducible Subshifts of Finite Type -- § 5.2 Almost-Topological Conjugacy -- Notes -- References -- 6. Further Topics -- § 6.1 Sofic Systems -- § 6.2 Markov Measures and the Maximal Measure -- § 6.3 Markov Subgroups -- § 6.4 Cellular Automata -- § 6.5 Channnel Codes -- Notes -- References -- 7. Countable State Markov Shifts -- § 7.1 Perron-Frobenius Theory -- § 7.2 Basic Symbolic Dynamics -- Notes -- References -- Name Index
|
| 653 |
|
|
|a Topology
|
| 653 |
|
|
|a Mathematical analysis
|
| 653 |
|
|
|a Computational intelligence
|
| 653 |
|
|
|a Analysis
|
| 653 |
|
|
|a Computational Intelligence
|
| 653 |
|
|
|a Topology
|
| 653 |
|
|
|a Analysis (Mathematics)
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Universitext
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-58822-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 515
|
| 520 |
|
|
|a This is a thorough introduction to the dynamics of one-sided and two-sided Markov shifts on a finite alphabet and to the basic properties of Markov shifts on a countable alphabet. These are the symbolic dynamical systems defined by a finite transition rule. The basic properties of these systems are established using elementary methods. The connections to other types of dynamical systems, cellular automata and information theory are illustrated with numerous examples. The book is written for graduate students and others who use symbolic dynamics as a tool to study more general systems
|