Automata TheoryEduardo R. Caianiello, Eduardo Renato Caianiello |
From inside the book
Try this search over all volumes: élément
Results 1-0 of 0
Contents
Generalizations of Regular Events | 1 |
vii | 24 |
Introduction to the CUCH | 57 |
Copyright | |
52 other sections not shown
Other editions - View all
Common terms and phrases
A-units a₁ a₂ algebra algorithm automata axiome B₁ bilatère c'est cardinal classes composition computation congruence congruence relation Considérons contient corresponding d-mots d'une defined definition délai borné denote deux effet élément elements ensemble equations equivalence relation être exists explicable fini finite automaton formula g-nets G₁ gauche à droite given grammaire graphe Hence homomorphism inaccessible cardinals input integer isomorphic k-algebra l'ensemble l'on langage engendré lattice Lemma linéaires linear logical M. P. Schützenberger M₁ m₂ Markov Markov algorithms matrices modules monoid mots n-tuple N₁ neurons nombre operation output partial recursive function partial-recursive peut predicate set problem proof propriété pseudo-variety qu'il quotient monoid R₁ recursively enumerable reduced k-algebra règle regular events Remarque reticular S₁ s₂ Schützenberger sequence seulement sommets sous groupe structure subset suivante symbol T₁ theorem theory tout transfinite transition transition tree Turing machine µƒ