nominal sets,210
nominal automata,154
test suite,180
orbit finite,82
splitting tree,68
set generators,53
automata learning,47
complete test,47
state space,45
separating sequences,42
deterministic automata,70
non deterministic,40
learning algorithms,60
black box,34
generating functions,33
membership queries,33
total order,33
join irreducible,32
order symmetry,31
separating family,31
probabilistic programs,29
residual automata,55
equivalence queries,27
mealy machines,55
infinite alphabets,26
nominal languages,26
observation table,26
register automata,26
finite set,48
finitely supported,24
state identifiers,24
test generation,24
characterisation set,23
non guessing,23
transition function,23
data structure,22
initial state,22
single orbit,22
test methods,22
compatible states,21
distinguishing sequence,21
finite state,21
automata theory,20
control software,20
fsm based,20
hybrid ads,20
minimal set,20
product automata,19
succinct automaton,19
model learning,18
can only,17
closed consistent,17
distinguishing tree,17
finite support,17
nominal techniques,17
regular languages,17
renaming sets,17
embedded control,16
equivariant map,16
ordered nominal,16
well defined,16
closed under,15
equality symmetry,15
fast computations,15
generation methods,15
nominal renaming,15
separated product,15
conformance testing,14
inequivalent states,14
local symmetries,14
active learning,13
data values,13
exact learning,13
generating function,13
residual languages,13
state identifier,13
succinct automata,13
upper bound,13
equivariant maps,12
minimal dfa,12
minimisation algorithm,12
partition refinement,12
program variables,12
implementation state,11
ioco relation,11
language semantics,11
guessing automata,10

total order symmetry,31
learning nominal automata,27
complete test suites,45
minimal separating sequences,25
minimal set generators,20
learning product automata,18
embedded control software,16
ordered nominal sets,16
residual nominal automata,16
adaptive distinguishing sequences,30
finite nominal set,15
non deterministic automata,15
test generation methods,15
fsm based test,14
applying automata learning,13
formal power series,13
nominal renaming sets,13
all pairs of states,12
black box testing,12
minimal splitting tree,12
non guessing automata,10
orbit finite sets,10
stable minimal splitting,10
hybrid ads method,9
orbit finite set,9
states are equivalent,9
black box systems,8
join irreducible elements,8
only finitely many,8
canonical residual automaton,7
complete splitting tree,7
moore minimisation algorithm,7
almost surely terminating,6
automata,512
states,476
algorithm,356
learning,301
testing,290
language,215
orbit,306
minimal,172
languages,157
model,145
implementation,142
sequences,138
deterministic,132
residual,132
proof,131
transition,128
output,126
equivariant,122
order,122
product,122
tree,121
function,118
input,118
queries,113
semantics,100
infinite,96
equivalence,94
method,92
software,92
structure,89
support,86
theory,83
alphabet,81
generators,81
time,77
construction,76
data,76
program,76
symmetry,89
ioco,62
representation,62
hypothesis,58
space,58
family,57
algebra,56
consistent,56
teacher,56
partition,53
action,52
relation,52
atoms,51
join,51
system,51
group,50
loop,50
counterexample,48
succinct,47
dimension,46
maps,46
complexity,45
canonical,44
characterisation,44
probabilistic,44
specification,44
fsm,42
nondeterministic,42
behaviour,40
observation,40
components,37
properties,35
formal,34
category,33
distribution,33
irreducible,33
monad,33
completeness,32
conformance,32
permutations,32
reachable,32
regular,31
unique,31
value,31
abstract,30
applications,30
control,30
derivatives,30
coalgebra,29
correct,28
minimisation,28
probability,28
compatible,27
experiments,27
library,27
power,26
research,26
isomorphism,25
rational,25
study,25
chain,24
interesting,24
bisimulation,23
functor,23