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