Kitchens B.P. — Symbolic dynamics: one-sided, two-sided and countable state markov shifts. :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Kitchens B.P. — Symbolic dynamics: one-sided, two-sided and countable state markov shifts.

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Symbolic dynamics: one-sided, two-sided and countable state markov shifts.

Автор: Kitchens B.P.

Аннотация:

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.

Язык:

Рубрика: Физика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1998

Количество страниц: 252

Добавлена в каталог: 11.06.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Recurrence weight      224
Regular language      148 188
Renewal Theorem      207 236
Resolving block      102
Road coloring problem      105 112
Roush, E.      2 3
Rudolph, D.      3
Run-length limited code      14 182
Ryan, J.P.      3
Salama, I.      7
Semi-group      148
Seneta, E.      7
Separated set      229
Shannon — McMillan — Breiman theorem      236
Shannon, C.      1 6
Shift equivalence      47 108 109
Shift equivalence of full shifts      49
Shift equivalence, problem      48
Shift equivalence, strong      45
Shift equivalence, weak      47
Shift transformation      2
Short exact sequence      79
Simple automorphism      70
Simple cycle      116
Sinai, Y.      1 5 6
Smale, S.      1
Sofic system      148 182
Sofic system, even system      148
Sofic system, irreducible      150
Sofic system, strictly      150
Solenoid      58
Spanning set      228
State splitting      34 41 105
States      21
Stationary probability vector      160
Stirling's formula      215 239
Subshift of finite type, countable state      226
Subshift of finite type, cyclic subsets      223
Subshift of finite type, cyclic subsets of indices      18
Subshift of finite type, irreducible      22 227

Subshift of finite type, mixing      182
Subshift of finite type, nonwandering      22 137
Subshift of finite type, period      100 142—143
Subshift of finite type, reducible      136
Subshift of finite type, topologically mixing      226
Subshift of finite type, topologically transitive      226
Subshift of finite type, transitive      22
Successor set of a symbol      34 105 178
Successor set of a word      148
Sullivan, D.      2
Symbol splitting      34 41
Symbolic dynamics      28
symbols      21
Tableau construction      141
Takahashi, Y.      7
Tent map      4
Time n wedge      228
Toral automorphism      11
Torus      53
Transition probability      160
Trow, P.      4
Tuncel, S.      2
Turing machine      75
Two-sided, automorphism group      91
Two-sided, full shift on n symbols      2
Two-sided, subshift of finite type      3
Two-sided, topological Markov shift      3
Uncertainty      165
Undecidable question      182
Variational Principle      190 229
Vere—Jones, D.      7
von Neumann, J.      6
Wagoner, J.      2 3
Weak topology      159
Weight of a path      196
Weiss, B.      1 4 5 6
William's conjecture      48
Williams, R.E.      1 2 3 6
Williams, S.      6
Word      21
Zeta function      24 152

1 2

О проекте