Главная    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
Предметный указатель
$U_{n}$-monoid      448
$\infty$-variety      270
$\omega$-rational      15
$\omega$-semigroup      92
$\omega$-semigroup quotient      94
$\omega$-semigroup, ordered syntactic      111
$\omega$-semigroup, trivial      92
$\omega$-subsemigroup      94
$\tilde{U}_{n}$-monoid      448
$\zeta$-rational      386
$\zeta$-semigroup      395
$\zeta$-semigroup, aperiodic      411
*-variety      477
+-variety      476
Accessible      235
action      448
Adherence point      137
Admissible      36
Algebra      465
Algebra profinite      469
Alphabet      6
Alphabet, ranked      415
Aperiodic      447 474 492
Aperiodic extension      492
Arena      196
Arity of a node      10
Arity of a tree      10
ASSIGNMENT      332
Attractor      197
Automaton      16
Automaton Borel      164
Automaton Buechi      25
Automaton Buechi tree      419
Automaton Muller      35
Automaton Muller tree      421
Automaton parity      203
Automaton product      20
Automaton Rabin      39
Automaton Rabin chain      43 203
Automaton Streett      41
Automaton transition Buechi      43
Automaton transition Muller      44
Automaton tree      417
Automaton trim      27
Automaton with multiplicity      105
Automaton, $\omega$-unambiguous      25
Automaton, $\zeta$-unambiguous      401
Automaton, Borel $\omega$-unambiguous      165
Automaton, Borel deterministic      165
Automaton, closed      173
Automaton, co-complete      25
Automaton, co-deterministic      25
Automaton, complete      419
Automaton, countable      17
Automaton, deterministic      25
Automaton, finite      17
Automaton, Muller non deterministic      70
Automaton, normalized      22
Automaton, ordered      89
Automaton, reversed      20
Automaton, transition co-deterministic      20
Automaton, transition deterministic      18
Automaton, unambiguous      20
Basis for a topology      136
Bi-automaton      393
Boolean algebra      219 475
Boolean algebra, positive      219
Borel automaton      164
Borel classes of finite order      141
Borel hierarchy      141
Borel set      141
Bounded occurrence      331
Bounded synchronization delay      365
Buechi automaton      25
Buechi tree automaton      419
Cantor Normal Form      218
Cantor set      152
Cauchy sequence      138
Chain      223 224
Chain derivation      225
Chain sign      224
Chain, negative      223 224
Chain, positive      223 224
Chain, strong      261
Child      414
class      219 475
Class, $\Gamma$-complete      219
Class, dual      142
Class, Polish      155
Class, self-dual      142
Clopen      142
Closure      137
Cofinite      477
COLOR      77
Compact      137
complete      18
Completion      139
Concatenation      7
Congruence      94
Congruence $\omega$-semigroup      94
Congruence ordered semigroup      439
Congruence semigroup      438
Congruence, nuclear      94 439
Congruence, syntactic      91 111
Conjugacy      79
Constant      365
Content      17
context      90
continuous      136
Countable      134
Countable alphabet      7
Cyclic      438
D-tree      414
Degree      253
Dense      137
Derivative      252
Deterministic      18
Deterministic bottom-up      418
Deterministic top-down      418
Diagonal argument      134
Direction      414
Disjunctive normal form      334
Distinguishable      406
Divide      438
Domain      332 336 414
Ecart      183
EDGE      16
Element conjugate      129
Element, linked      79
Embedding      216
Existential      335
Expansion, strong      286
EXPONENT      442
Factor      7
Factor, left      7
Factor, proper      8
Factor, right      7
Factor, strict      8
Factorization      77
Factorization conjugate      80
Factorization Ramseyan      77
final      17 35 70
Finite component      270
Fixpoint-free      130
Formula atomic second-order      331
Formula first-order      330
Formula logically equivalent      334
Formula second-order      332
Formula, atomic      330
Free occurrence      331
Frontier      415
Frontier, outer      415
Function, sequential      209
Function, synchronous      209
Game      188
Game Fraisse — Ehrenfeucht      357
Game of partitions      211
Game parity      202
Game rules      189
Game Wadge      207
Game, determined      189 357
Graph game      196
Grundy      211
Hausdorff      137
Height      414
Hierarchy Borel      141
Hierarchy chain      230
Hierarchy superchain      234 242
Hierarchy Wagner      250
Hierarchy, Boolean      219
Hierarchy, logical      348
Homeomorphism      136
Homeomorphism uniform      139
Ideal      443
Ideal order      436
Ideal order of an $\omega$-semigroup      93
Ideal shuffle      487
Ideal, left      443
Ideal, order recognizable      88
Ideal, right      443
Ideal, T-minimal      407
Idempotent      441
Identity      467
Ill-founded      433
Image      101
Image, syntactic      111
INDEX      441
Indistinguishable      406
Initial      17 35 70
Instruction      427
Invariant shift      382
Isometry      139
Isomorphism      94 216 438
Koenig's lemma      12 181
Label of a path      17
Labeled tree      12
Language of the linear order      337
Language of the successor      337
Last appearance record      203
Leaf      415
Left linked      396
Length of a chain      224
letter      6
LIMIT      137
Linear ordering      216
Linked pair      79
Linked pair conjugate      79
Linked pair idempotent      85
Lipschitz      139
Local property      307
Local, left      493
Local, right      493
Locally      458
Locally finite      478
Locally testable      319 495
Locally trivial      458
Logic first-order      329
Logic monadic second-order      332
Logic monadic weak      334
Logic second-order      331
Logic, temporal      363
Logical symbol      329
Map, closed      137
Map, open      137
Memory extension      203 423
Metric      137
Metric subsemigroup      469
Metric, compatible      138
Metric, completely compatible      138
Minimal      447
Minimum excluded      211
Monadic second order      430
Monoid      436
Monoid, commutative      436
Monoid, free      7
Morphism $\zeta$-semigroup      396
Morphism monoid      437
Morphism ordered $\omega$-semigroup      94
Morphism semigroup      437
Morphism semiring      437
Morphism syntactic      91
Morphism that recognizes      86
Morphism, alphabetic      16
Morphism, fiber bounded      163
Muller automaton      35
Muller tree automaton      421
Negative chain      223 224
Negative superchain      235 237
Nilpotent      474
Node of a tree      414
Node, marked      47
Open $\varepsilon$-ball      138
Orbit      384
Order      435
Order type      216
Order, dual      436
Order, lexicographic      8
Order, linear      216
Order, partial      435
Ordered $\omega$-semigroup      93
Ordered $\omega$-semigroup, dual      93
Ordered semigroup transition      90
Ordered semigroup, syntactic      91
Ordinal      218
Ordinal limit      218
Ordinal product      217
Ordinal successor      218
Oriented tree      10
Parity condition      201
Path      12 17 15
Path bi-infinite      386
Path, final      25 43
Path, infinite      12 17
Path, initial      25 43
Path, successful      17 25
Period      441
Play      188
Polish class      155
Polish space      140
POSITION      188
Positive boolean algebra      219 475
Positive boolean combination      476
Positive chain      223
Positive superchain      235 237
Positive, variety $\infty$-      270
Positive, variety *-      476
Positive, variety +-      476
Positively locally testable      496
Prefix      7
Prefix-closed      9
Prefix-free      9
Prenex normal form      335
Preorder Wadge      215
Presburger arithmetic      377
PRODUCT      7 438
Product of $\omega$-semigroups      96
Product, diagonal      170
Product, infinite      92
Product, mixed      92
Profinite      471
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте