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

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

blank
blank
blank
Красота
blank
Ito M. — Algebraic Theory of Automata and Languages
Ito M. — Algebraic Theory of Automata and Languages

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

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



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


Название: Algebraic Theory of Automata and Languages

Автор: Ito M.

Аннотация:

The theory of formal languages and the theory of automata were both initiated in the late 1950s, explains Ito (Kyoto Sangyo U., Japan), and the two fields have since developed into important theoretical foundations of computer science. He looks at the two from the algebraic perspective, beginning with the algebraic structure of automata, and partially ordered sets of automata as a kind of global theory. Then he delves into grammars, languages, and operations on languages. To conclude, he introduces directable automata as a special case.


Язык: en

Рубрика: Математика/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Acceptor      3
Acceptor, finite      3 85
Acceptor, nondeterministic      85
Acceptor, pushdown      3 89
Algorithm      3
Alphabet      2 6 84
Automaton      3 6 64
Automaton, (n, G)-      10
Automaton, abelian      65
Automaton, commutative      7 65 159
Automaton, cyclic      64
Automaton, directable      4 75 157
Automaton, factor      38
Automaton, generalized group-matrix type      51
Automaton, group-type      65
Automaton, nondeterministic      163
Automaton, perfect      7 65
Automaton, permutation      8
Automaton, pullback      78
Automaton, quasiperfect      65
Automaton, regular group-matrix type      5
Automaton, simplified      8
Automaton, strongly connected      6 64
Automaton, strongly directable      75
Automaton, strongly related      64
Automaton, transitive      65
Automaton, X-      64
Automorphism      2 6 65
Bijection      1
class      66
Class, strong      63 66
Code      2 134
Code, bifix      3 134
Code, infix      3 134
Code, maximal      134
Code, prefix      3 134
Code, suffix      3 134
Concatenation      2 92
Decidable      3
Decomposition      99
Decomposition, maximal      99
Del-closure      132
Deletion      127 130
Deletion closure      132
Deletion closure of a language      132
Deletion, iterated      130
Derivation      84
Direct product      35 64
Effectively constructed      3
Endomorphism      2 6
Equivalent to each other      22 30
Generalized group-matrix of order n      52
Generalized group-matrix type automaton of order n      54
Generalized group-vector of order n      53
Generalized shuffle residual      149
Generator      64
Grammar      2 84
Grammar, context-free      2 84
grammar, regular      2 84
Greibach normal form      84
Group      1
Group, automorphism      6 65
Group, commutative      2
Group, quotient      1
Group, simple      2
Group-matrix of order n      9
Group-matrix type automaton of order n      10
Group-type automaton with group G      65
Group-vector of order n      9
h-descendant      124
Homomorphic image      64
Homomorphism      2 6 64 93
Homomorphism, natural      2
Hypercode      3 114 124
Initial state      85
Injection      1
Ins-base      135
insertion      94 127 128
Insertion base      135
Insertion closure      127 129
Insertion closure of a language      127 129
Insertion residual      127
Isomorphic to each other      6
Isomorphism      2 6 64
Isomorphism in wider sense      23
Iterated deletion      130
Iterated shuffle      143
K-product      35
Kernel      2
Kronecker product      35
Language      2 83
Language, accepted by an acceptor      85
Language, commutative      103 114
Language, context-free      2 83 84
Language, del-closed      132
Language, deletion closed      132
Language, generated by a grammar      84
Language, ins-closed      129
Language, insertion closed      129
Language, nontrivial      93
Language, recognized by an acceptor      85
Language, regular      2 83 84
Language, RSS-type      145
Language, sh-closed      113
Language, shuffle closed      113
Language, ssh-closed      113
Language, strongly shuffle closed      113
Lattice      3
Monoid      1
Monoid, characteristic      30
Monoid, commutative      2
Monoid, free      2
n-insertion      4 83 93
n-shuffle      99
Nondeterministic acceptor with e-move      85
Nondeterministic automaton      163
Nondeterministic automaton of partial function type      169
Nondeterministic automaton of pf-type      169 175
Nondeterministic automaton, $D_i$-directable      163
Nondeterministic automaton, commutative      181
Nondeterministic automaton, complete      164
Order      124
Order, embedding      124
Parikh mapping      102
Partial order      3
Partially ordered set      3
POSET      3
Principal congruence      84
Production rules      84
Pullback system      77
Regular      56
Regular (n, G)-automaton      12
Regular system      22
Root      118
Root of a semigroup      118
Scattered deletion      151
Scattered deletion closure      153
Scattered deletion closure of a language      153
sd-closure      153
Semigroup      1
Semigroup, free      2
Separation condition      52
Set of final state      85
Set of initial states      85
sh-base      114
sh-free      114
Shuffle      4 83
Shuffle base      114
Shuffle closure      103 144
Shuffle closure of a language      103 144
Shuffle product      93
Shuffle product of a language      93 103
Shuffle product of words      93 103
Shuffle residual      141
SP-condition      51 52
Stack symbol      89
Start symbol      84
State set      6 85
State transition function      6 85
Subautomaton      64
Subgroup      1
Subgroup, normal      1
Subword      160
Subword, sparse      151
Surjection      1
Undecidable      3
Variables      84
Word      2 84
Word, $D_1$-directing      163
Word, $D_2$-directing      163
Word, $D_3$-directing      163
Word, $D_3$-merging      179
Word, $D_i$-directing      163
Word, directing      157
Word, empty      2 64 84
Word, merged      160
Word, overlapping      138
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте