3.7 KiB
3.7 KiB
1 | nominal sets | 210 |
---|---|---|
2 | nominal automata | 154 |
3 | test suite | 180 |
4 | orbit finite | 82 |
5 | splitting tree | 68 |
6 | set generators | 53 |
7 | automata learning | 47 |
8 | complete test | 47 |
9 | state space | 45 |
10 | separating sequences | 42 |
11 | deterministic automata | 70 |
12 | non deterministic | 40 |
13 | learning algorithms | 60 |
14 | black box | 34 |
15 | generating functions | 33 |
16 | membership queries | 33 |
17 | total order | 33 |
18 | join irreducible | 32 |
19 | order symmetry | 31 |
20 | separating family | 31 |
21 | probabilistic programs | 29 |
22 | residual automata | 55 |
23 | equivalence queries | 27 |
24 | mealy machines | 55 |
25 | infinite alphabets | 26 |
26 | nominal languages | 26 |
27 | observation table | 26 |
28 | register automata | 26 |
29 | finite set | 48 |
30 | finitely supported | 24 |
31 | state identifiers | 24 |
32 | test generation | 24 |
33 | characterisation set | 23 |
34 | non guessing | 23 |
35 | transition function | 23 |
36 | data structure | 22 |
37 | initial state | 22 |
38 | single orbit | 22 |
39 | test methods | 22 |
40 | compatible states | 21 |
41 | distinguishing sequence | 21 |
42 | finite state | 21 |
43 | automata theory | 20 |
44 | control software | 20 |
45 | fsm based | 20 |
46 | hybrid ads | 20 |
47 | minimal set | 20 |
48 | product automata | 19 |
49 | succinct automaton | 19 |
50 | model learning | 18 |
51 | can only | 17 |
52 | closed consistent | 17 |
53 | distinguishing tree | 17 |
54 | finite support | 17 |
55 | nominal techniques | 17 |
56 | regular languages | 17 |
57 | renaming sets | 17 |
58 | embedded control | 16 |
59 | equivariant map | 16 |
60 | ordered nominal | 16 |
61 | well defined | 16 |
62 | closed under | 15 |
63 | equality symmetry | 15 |
64 | fast computations | 15 |
65 | generation methods | 15 |
66 | nominal renaming | 15 |
67 | separated product | 15 |
68 | conformance testing | 14 |
69 | inequivalent states | 14 |
70 | local symmetries | 14 |
71 | active learning | 13 |
72 | data values | 13 |
73 | exact learning | 13 |
74 | generating function | 13 |
75 | residual languages | 13 |
76 | state identifier | 13 |
77 | succinct automata | 13 |
78 | upper bound | 13 |
79 | equivariant maps | 12 |
80 | minimal dfa | 12 |
81 | minimisation algorithm | 12 |
82 | partition refinement | 12 |
83 | program variables | 12 |
84 | implementation state | 11 |
85 | ioco relation | 11 |
86 | language semantics | 11 |
87 | guessing automata | 10 |
88 | total order symmetry | 31 |
89 | learning nominal automata | 27 |
90 | complete test suites | 45 |
91 | minimal separating sequences | 25 |
92 | minimal set generators | 20 |
93 | learning product automata | 18 |
94 | embedded control software | 16 |
95 | ordered nominal sets | 16 |
96 | residual nominal automata | 16 |
97 | adaptive distinguishing sequences | 30 |
98 | finite nominal set | 15 |
99 | non deterministic automata | 15 |
100 | test generation methods | 15 |
101 | fsm based test | 14 |
102 | applying automata learning | 13 |
103 | formal power series | 13 |
104 | nominal renaming sets | 13 |
105 | all pairs of states | 12 |
106 | black box testing | 12 |
107 | minimal splitting tree | 12 |
108 | non guessing automata | 10 |
109 | orbit finite sets | 10 |
110 | stable minimal splitting | 10 |
111 | hybrid ads method | 9 |
112 | orbit finite set | 9 |
113 | states are equivalent | 9 |
114 | black box systems | 8 |
115 | join irreducible elements | 8 |
116 | only finitely many | 8 |
117 | canonical residual automaton | 7 |
118 | complete splitting tree | 7 |
119 | moore minimisation algorithm | 7 |
120 | almost surely terminating | 6 |
121 | automata | 512 |
122 | states | 476 |
123 | algorithm | 356 |
124 | learning | 301 |
125 | testing | 290 |
126 | language | 215 |
127 | orbit | 306 |
128 | minimal | 172 |
129 | languages | 157 |
130 | model | 145 |
131 | implementation | 142 |
132 | sequences | 138 |
133 | deterministic | 132 |
134 | residual | 132 |
135 | proof | 131 |
136 | transition | 128 |
137 | output | 126 |
138 | equivariant | 122 |
139 | order | 122 |
140 | product | 122 |
141 | tree | 121 |
142 | function | 118 |
143 | input | 118 |
144 | queries | 113 |
145 | semantics | 100 |
146 | infinite | 96 |
147 | equivalence | 94 |
148 | method | 92 |
149 | software | 92 |
150 | structure | 89 |
151 | support | 86 |
152 | theory | 83 |
153 | alphabet | 81 |
154 | generators | 81 |
155 | time | 77 |
156 | construction | 76 |
157 | data | 76 |
158 | program | 76 |
159 | symmetry | 89 |
160 | ioco | 62 |
161 | representation | 62 |
162 | hypothesis | 58 |
163 | space | 58 |
164 | family | 57 |
165 | algebra | 56 |
166 | consistent | 56 |
167 | teacher | 56 |
168 | partition | 53 |
169 | action | 52 |
170 | relation | 52 |
171 | atoms | 51 |
172 | join | 51 |
173 | system | 51 |
174 | group | 50 |
175 | loop | 50 |
176 | counterexample | 48 |
177 | succinct | 47 |
178 | dimension | 46 |
179 | maps | 46 |
180 | complexity | 45 |
181 | canonical | 44 |
182 | characterisation | 44 |
183 | probabilistic | 44 |
184 | specification | 44 |
185 | fsm | 42 |
186 | nondeterministic | 42 |
187 | behaviour | 40 |
188 | observation | 40 |
189 | components | 37 |
190 | properties | 35 |
191 | formal | 34 |
192 | category | 33 |
193 | distribution | 33 |
194 | irreducible | 33 |
195 | monad | 33 |
196 | completeness | 32 |
197 | conformance | 32 |
198 | permutations | 32 |
199 | reachable | 32 |
200 | regular | 31 |
201 | unique | 31 |
202 | value | 31 |
203 | abstract | 30 |
204 | applications | 30 |
205 | control | 30 |
206 | derivatives | 30 |
207 | coalgebra | 29 |
208 | correct | 28 |
209 | minimisation | 28 |
210 | probability | 28 |
211 | compatible | 27 |
212 | experiments | 27 |
213 | library | 27 |
214 | power | 26 |
215 | research | 26 |
216 | isomorphism | 25 |
217 | rational | 25 |
218 | study | 25 |
219 | chain | 24 |
220 | interesting | 24 |
221 | bisimulation | 23 |
222 | functor | 23 |