222 lines
3.7 KiB
CSV
222 lines
3.7 KiB
CSV
210,nominal sets
|
|
154,nominal automata
|
|
180,test suite
|
|
82,orbit finite
|
|
68,splitting tree
|
|
53,set generators
|
|
47,automata learning
|
|
47,complete test
|
|
45,state space
|
|
42,separating sequences
|
|
70,deterministic automata
|
|
40,non deterministic
|
|
60,learning algorithms
|
|
34,black box
|
|
33,generating functions
|
|
33,membership queries
|
|
33,total order
|
|
32,join irreducible
|
|
31,order symmetry
|
|
31,separating family
|
|
29,probabilistic programs
|
|
55,residual automata
|
|
27,equivalence queries
|
|
55,mealy machines
|
|
26,infinite alphabets
|
|
26,nominal languages
|
|
26,observation table
|
|
26,register automata
|
|
48,finite set
|
|
24,finitely supported
|
|
24,state identifiers
|
|
24,test generation
|
|
23,characterisation set
|
|
23,non guessing
|
|
23,transition function
|
|
22,data structure
|
|
22,initial state
|
|
22,single orbit
|
|
22,test methods
|
|
21,compatible states
|
|
21,distinguishing sequence
|
|
21,finite state
|
|
20,automata theory
|
|
20,control software
|
|
20,fsm based
|
|
20,hybrid ads
|
|
20,minimal set
|
|
19,product automata
|
|
19,succinct automaton
|
|
18,model learning
|
|
17,can only
|
|
17,closed consistent
|
|
17,distinguishing tree
|
|
17,finite support
|
|
17,nominal techniques
|
|
17,regular languages
|
|
17,renaming sets
|
|
16,embedded control
|
|
16,equivariant map
|
|
16,ordered nominal
|
|
16,well defined
|
|
15,closed under
|
|
15,equality symmetry
|
|
15,fast computations
|
|
15,generation methods
|
|
15,nominal renaming
|
|
15,separated product
|
|
14,conformance testing
|
|
14,inequivalent states
|
|
14,local symmetries
|
|
13,active learning
|
|
13,data values
|
|
13,exact learning
|
|
13,generating function
|
|
13,residual languages
|
|
13,state identifier
|
|
13,succinct automata
|
|
13,upper bound
|
|
12,equivariant maps
|
|
12,minimal dfa
|
|
12,minimisation algorithm
|
|
12,partition refinement
|
|
12,program variables
|
|
11,implementation state
|
|
11,ioco relation
|
|
11,language semantics
|
|
10,guessing automata
|
|
31,total order symmetry
|
|
27,learning nominal automata
|
|
45,complete test suites
|
|
25,minimal separating sequences
|
|
20,minimal set generators
|
|
18,learning product automata
|
|
16,embedded control software
|
|
16,ordered nominal sets
|
|
16,residual nominal automata
|
|
30,adaptive distinguishing sequences
|
|
15,finite nominal set
|
|
15,non deterministic automata
|
|
15,test generation methods
|
|
14,fsm based test
|
|
13,applying automata learning
|
|
13,formal power series
|
|
13,nominal renaming sets
|
|
12,all pairs of states
|
|
12,black box testing
|
|
12,minimal splitting tree
|
|
10,non guessing automata
|
|
10,orbit finite sets
|
|
10,stable minimal splitting
|
|
9,hybrid ads method
|
|
9,orbit finite set
|
|
9,states are equivalent
|
|
8,black box systems
|
|
8,join irreducible elements
|
|
8,only finitely many
|
|
7,canonical residual automaton
|
|
7,complete splitting tree
|
|
7,moore minimisation algorithm
|
|
6,almost surely terminating
|
|
512,automata
|
|
476,states
|
|
356,algorithm
|
|
301,learning
|
|
290,testing
|
|
215,language
|
|
306,orbit
|
|
172,minimal
|
|
157,languages
|
|
145,model
|
|
142,implementation
|
|
138,sequences
|
|
132,deterministic
|
|
132,residual
|
|
131,proof
|
|
128,transition
|
|
126,output
|
|
122,equivariant
|
|
122,order
|
|
122,product
|
|
121,tree
|
|
118,function
|
|
118,input
|
|
113,queries
|
|
100,semantics
|
|
96,infinite
|
|
94,equivalence
|
|
92,method
|
|
92,software
|
|
89,structure
|
|
86,support
|
|
83,theory
|
|
81,alphabet
|
|
81,generators
|
|
77,time
|
|
76,construction
|
|
76,data
|
|
76,program
|
|
89,symmetry
|
|
62,ioco
|
|
62,representation
|
|
58,hypothesis
|
|
58,space
|
|
57,family
|
|
56,algebra
|
|
56,consistent
|
|
56,teacher
|
|
53,partition
|
|
52,action
|
|
52,relation
|
|
51,atoms
|
|
51,join
|
|
51,system
|
|
50,group
|
|
50,loop
|
|
48,counterexample
|
|
47,succinct
|
|
46,dimension
|
|
46,maps
|
|
45,complexity
|
|
44,canonical
|
|
44,characterisation
|
|
44,probabilistic
|
|
44,specification
|
|
42,fsm
|
|
42,nondeterministic
|
|
40,behaviour
|
|
40,observation
|
|
37,components
|
|
35,properties
|
|
34,formal
|
|
33,category
|
|
33,distribution
|
|
33,irreducible
|
|
33,monad
|
|
32,completeness
|
|
32,conformance
|
|
32,permutations
|
|
32,reachable
|
|
31,regular
|
|
31,unique
|
|
31,value
|
|
30,abstract
|
|
30,applications
|
|
30,control
|
|
30,derivatives
|
|
29,coalgebra
|
|
28,correct
|
|
28,minimisation
|
|
28,probability
|
|
27,compatible
|
|
27,experiments
|
|
27,library
|
|
26,power
|
|
26,research
|
|
25,isomorphism
|
|
25,rational
|
|
25,study
|
|
24,chain
|
|
24,interesting
|
|
23,bisimulation
|
|
23,functor
|