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

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

blank
blank
blank
Красота
blank
Perrin D., Pin J.-E. — Infinite Words: Automata, Semigroups, Logic abd Games
Perrin D., Pin J.-E. — Infinite Words: Automata, Semigroups, Logic abd Games



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



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


Название: Infinite Words: Automata, Semigroups, Logic abd Games

Авторы: Perrin D., Pin J.-E.

Аннотация:

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic.


Язык: en

Рубрика: Computer science/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Projection      414
Projective set      185
Prophetic automaton      122
Prophetic transition automaton      122
Pure      305
Quantifier      329
Quantifier height      356
Quotient      438
Rabin automaton      39
Rabin chain condition      201
Rabin index      262
Ramsey theorem      77
Ramseyan factorization      128
Rank      190
Recognition weak      277
Recognizable      25 418
Recognizable by $\omega$-semigroup      101
Reduction      207
refinement      136
Regular      445
Relation      435
Relation coarser      436
Relation equivalence      435
Relation preorder      435
Relation syntactic order      91
Relation, antisymmetric      435
Relation, reflexive      435
Relation, stable      436
Relation, symmetric      435
Relation, transitive      435
Relation, universal      436
Residual      91
Run      417 419
Run, successful      419
Scanner      307
Second order weak      432
Self-dual      219
Semigroup      436
Semigroup free pro-V      471
Semigroup free profinite      471
Semigroup n      448
Semigroup ordered transition      90
Semigroup recognizes      86
Semigroup separates      469
Semigroup transformation      448
Semigroup transition      87
Semigroup, free      7
Semigroup, generated      438
Semigroup, left local      493
Semigroup, local      442
Semigroup, metric      469
Semigroup, ordered      436
Semigroup, ordered dual      436
Semigroup, relatively free      304
Semigroup, right local      493
Semigroup, separating      182
Semigroup, syntactic      91
Semiring      437
Semiring, commutative      437
Separable subsets      177
Sequence, converging      137
Set Borel      141
Set compact      137
Set Suslin      168
Set, closed      136
Set, open      136
Shift      382
SIZE      60
Space metric      138
Space Polish      140
Space Suslin      175
Space, complete      138
Space, completely metrizable      138
Space, completely regular      182
Space, metrizable      138
Space, normal      182
Space, topological      136
Spectrum      337
Stable      436
Star-free      295 481
State      16
State live      425
State, accessible      27 36
State, coaccessible      27 36
State, final      16 25
State, infinitely repeated      17
State, initial      16
State, terminal      16
Statement      331
Strategy      188
Strategy finite memory      206
Strategy memoryless      196
Strategy, rational      206
Strategy, winning      189
Streett automaton      41
Structure      332
Subgame      192 197
Submonoid      438
Subsemigroup      438
Subset, $\omega$-rational      15
Subset, $\zeta$-rational      386
Subset, bounded      139
Subset, deterministic      32
Subset, open      69
Subset, recognizable      86
Subset, relatively compact      138
Subset, simple      79
Subset, transitive      407
Substitution, marked      365
Substitution, mathcal F-      365
Subword      487
Successful      17 35 44 70 417
Suffix      7
Superchain, negative      235 237
Superchain, positive      235 237
Superfactorization      77
Supremum      469
Suslin class      429
Suslin set      168
Suslin space      175
Symmetrical difference      259
Synchronised product      401
table      35 44
Table, full      41
Temporal logic      363
Temporal logic, restricted      373
Term      330
Testable prefix      493
Testable prefix-suffix      494
Testable suffix      493
Threshold locally testable      322 496
Threshold prefix-factors testable      359
topology      136
Topology coarser      136
Topology discrete      136
Topology product      136
Topology relative      136
Topology stronger      136
Topology, strong      182
Topology, trivial      136
Trace      277
Transducer      168
Transition      16
Transition function      18
Transition, consecutive      17
Transition, cutting      125
Transition, matrix      20
Trap      197
TREE      9
Tree automaton      417
Tree equivalent      10
Tree infinite      416
Tree split      199
Tree syntax      415
Tree, automaton alternating      434
Tree, planar      10
Tree, rational      416 424
Tree, well-founded      433
Triple conjugate      396
Triple, linked      396
Ultrametric      180
Uniformly continuous      139
Union, biseparated      222
Union, countable      135
Union, separated      221
Universal      155
V-free semigroup      466
Valuation      332
Valuation second-order      333
Variable first-order      331
Variable second-order      331
Variable set      332
Variety $\omega$-component      270
Variety Birkhoff      465
Variety of $\omega$-semigroups      267
Variety of finite semigroups      468
Variety, generated      469
Variety, local      493
Wadge class      207 219
Wadge degree      219
Wadge equivalence      207
Wadge game      207
Wadge preorder      215
Wadge reduction      207
Weak acceptance      68
Well-founded Tree      433
Well-ordering      218
Wilke $\zeta$-algebra      396
Wilke algebra      98
Wilke, algebra ordered      99
Winning policy      197
Winning position      189
Winning strategy      189
Word      7
Word, bi-infinite      382
Word, empty      7
Word, infinite      7
Word, left infinite      382
Word, marked      342
Word, recurrent      84 407
Word, rich      412
Word, simple      70
Zero      442
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте