 ,  matrix 6
1-automaton 127
2-automaton 127
3-automaton 128
4-automaton 129
5-automaton 129
Abstract machine 84
Accepted pair of tapes 134
Accepted tape 107 110
Adder 9
Applicable tape 44
Automaton 107
Boolean algebra of sets 1
Cartesian product 2
Closed family 66
Compatible 61
Complement 1
Complementation 1
Complex product 114
Congruence relation 4
Denumerable 3
Denumerably infinite 3
Direct sum 14 72
Directed edge 2
Disjoint 1
Distinguished machine 19
Distinguished quasimachine 89
Dual 121
Equivalence class 2
Equivalence relation 2
Equivalent automata 122
Equivalent machines 10
Equivalent quasimachines 89
Equivalent states 9 89
Experiment 31
Extension (function) 3
Extension (machine) 67
Finite index 2
Flow table 6
Free semigroup 3
Free semigroup with identity 3
Function 3
Generating set 3
Homomorphism 4
Identity element 3
Incompatible 61
Incomplete automaton 130
Input-distinguished 93
Input-equivalent 93
Input-independent 41 65
Input-isomorphic 95
| Intersection 1
Inverse 100
Isomorphic machines 18 67
Isomorphic quasimachines 90
Isomorphism 4
Label 2
Labeled directed graph 2
Left cancellation law 3
Left invariant 4
Length of experiment 3
Maximal compatible 67
Merging technique 20
Minimal-state machine 46
Minimization problem 45
Mod 4 counter 9
Mod n counter 14
Next-state function 5 84 107
Node 2
Non  -automaton 123
Nondenumerable 3
Nondeterministic automaton 110
One-to-one 3
Onto 3
Output function 5 84
Output-empty 49
Partition 2
Quasimachine 83
refinement 2
Regular set 108
Relation 2
Restriction 3
Right invariant 4
Semi-inverse 100
Semigroup 3
Sequential machine, complete 5
Sequential machine, generalized 20
Sequential machine, incomplete 43
Sequential switching circuit 22
Set of relations 86
Shift-left register 9
Star operation 114
State graph 9
Strongly connected 28 72
Submachine 30
Tape 6 107
Transition diagram 9
Two-tape automaton 134
Two-way automaton 132
Ultimately periodic sequence 20
Ultimately periodic set of non-negative integers 110
Uniform experiment 31
union 1
|
|
|
О проекте