Archived
1
Fork 0
This repository has been archived on 2025-04-09. You can view files and clone it, but cannot push or open issues or pull requests.
word-parse/output/biwords.csv
2020-11-16 10:32:56 +01:00

88 lines
1.7 KiB
CSV

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