======================================
Data_files_1
======================================

These are the transition tables for the CATAM project "Minimisation of Deterministic Finite-State Automata".
The rightmost column of each table gives the accept states: 1 denotes accept, 0 denotes non-accept.
Each row corresponds to a single state. Each column (apart from the last) to a single letter.
Thus, a table with n rows and k columns defines a DFA on n states with k-1 letters. 
By convention, state 1 is always the start state.


======================================

Table1

2 5 1
10 10 1
1 2 0
8 3 0
9 2 0
9 2 0
1 9 1
4 6 0
3 6 0
9 2 1


=====================================

Table2

6 4 7 1
3 6 5 0
2 6 2 0
6 2 2 0
7 7 3 0
3 7 6 0
5 4 6 0


======================================

Table3

9 5 5 1
7 2 6 0
7 4 1 0
1 2 8 0
8 1 6 0
9 9 8 0
9 3 4 0
8 3 5 0
8 3 1 0


=====================================

Table4

18  65  1
67  33  1
34  66  1
90  75  1
12  59  1
99  75  1
54  24  1
71  74  1
100  98  1
29  87  1
42  9  1
47  37  1
77  37  1
82  69  1
11  60  1
18  79  1
36  37  1
6  21  1
53  9  1
34  78  1
18  21  1
21  39  1
91  56  1
68  23  1
47  65  1
92  49  1
11  16  1
75  79  1
74  11  1
57  30  1
19  24  1
60  54  1
30  10  1
14  41  1
22  11  1
90  12  1
8  79  1
25  30  1
6  61  1
45  97  1
2  44  1
90  70  1
20  76  1
10  44  1
31  66  1
46  11  1
11  94  1
100  19  1
34  27  1
30  80  1
7  49  1
30  77  1
5  40  1
51  28  1
77  4  1
64  68  1
9  43  1
9  46  1
78  61  1
91  6  1
54  32  1
11  78  1
83  70  1
34  13  1
30  14  1
75  10  1
2  1  1
5  43  1
67  66  1
61  73  1
53  54  1
73  11  1
71  64  1
79  13  1
29  14  1
70  10  1
56  15  1
40  17  1
7  20  1
79  32  1
34  32  1
61  22  1
75  26  1
11  90  1
13  71  1
55  56  1
49  19  1
90  22  1
80  8  1
74  92  1
6  71  1
8  56  1
9  32  1
80  17  1
95  63  1
69  99  1
14  18  1
73  26  1
12  40  1
12  8  1