850 B
850 B
1 | total order symmetry | 31 |
---|---|---|
2 | learning nominal automata | 27 |
3 | complete test suites | 45 |
4 | minimal separating sequences | 25 |
5 | minimal set generators | 20 |
6 | learning product automata | 18 |
7 | embedded control software | 16 |
8 | ordered nominal sets | 16 |
9 | residual nominal automata | 16 |
10 | adaptive distinguishing sequences | 30 |
11 | finite nominal set | 15 |
12 | non deterministic automata | 15 |
13 | test generation methods | 15 |
14 | fsm based test | 14 |
15 | applying automata learning | 13 |
16 | formal power series | 13 |
17 | nominal renaming sets | 13 |
18 | all pairs of states | 12 |
19 | black box testing | 12 |
20 | minimal splitting tree | 12 |
21 | non guessing automata | 10 |
22 | orbit finite sets | 10 |
23 | stable minimal splitting | 10 |
24 | hybrid ads method | 9 |
25 | orbit finite set | 9 |
26 | states are equivalent | 9 |
27 | black box systems | 8 |
28 | join irreducible elements | 8 |
29 | only finitely many | 8 |
30 | canonical residual automaton | 7 |
31 | complete splitting tree | 7 |
32 | moore minimisation algorithm | 7 |
33 | almost surely terminating | 6 |