word-parse/output/biwords.csv

1	nominal sets	210
2	nominal automata	154
3	test suite	180
4	orbit finite	82
5	splitting tree	68
6	set generators	53
7	automata learning	47
8	complete test	47
9	state space	45
10	separating sequences	42
11	deterministic automata	70
12	non deterministic	40
13	learning algorithms	60
14	black box	34
15	generating functions	33
16	membership queries	33
17	total order	33
18	join irreducible	32
19	order symmetry	31
20	separating family	31
21	probabilistic programs	29
22	residual automata	55
23	equivalence queries	27
24	mealy machines	55
25	infinite alphabets	26
26	nominal languages	26
27	observation table	26
28	register automata	26
29	finite set	48
30	finitely supported	24
31	state identifiers	24
32	test generation	24
33	characterisation set	23
34	non guessing	23
35	transition function	23
36	data structure	22
37	initial state	22
38	single orbit	22
39	test methods	22
40	compatible states	21
41	distinguishing sequence	21
42	finite state	21
43	automata theory	20
44	control software	20
45	fsm based	20
46	hybrid ads	20
47	minimal set	20
48	product automata	19
49	succinct automaton	19
50	model learning	18
51	can only	17
52	closed consistent	17
53	distinguishing tree	17
54	finite support	17
55	nominal techniques	17
56	regular languages	17
57	renaming sets	17
58	embedded control	16
59	equivariant map	16
60	ordered nominal	16
61	well defined	16
62	closed under	15
63	equality symmetry	15
64	fast computations	15
65	generation methods	15
66	nominal renaming	15
67	separated product	15
68	conformance testing	14
69	inequivalent states	14
70	local symmetries	14
71	active learning	13
72	data values	13
73	exact learning	13
74	generating function	13
75	residual languages	13
76	state identifier	13
77	succinct automata	13
78	upper bound	13
79	equivariant maps	12
80	minimal dfa	12
81	minimisation algorithm	12
82	partition refinement	12
83	program variables	12
84	implementation state	11
85	ioco relation	11
86	language semantics	11
87	guessing automata	10