====================================== 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 1 5 0 3 7 1 7 7 0 8 7 0 4 3 0 10 2 0 10 8 1 8 9 1 9 9 0 10 10 0 ===================================== Table2 3 3 9 0 6 6 4 1 5 8 5 0 6 4 6 0 2 2 2 1 6 4 4 0 9 1 1 0 5 5 5 0 4 2 2 0 ====================================== Table3 1 2 3 1 4 5 6 0 1 2 3 0 4 5 6 0 1 2 3 0 4 5 6 0 ===================================== Table4 8 67 82 1 39 83 68 1 1 97 21 0 22 6 32 1 1 45 14 1 19 58 67 0 15 68 57 1 27 72 17 1 18 65 15 0 14 72 48 0 60 38 90 1 90 58 55 1 93 12 4 1 22 6 6 0 48 97 80 1 38 29 45 1 52 59 38 1 27 96 79 1 7 19 37 0 44 20 53 0 18 34 71 0 3 93 87 0 95 39 33 0 43 28 65 0 96 16 97 1 76 40 8 1 1 38 59 0 68 13 41 0 70 44 31 0 64 10 27 0 55 61 76 0 22 2 99 0 77 57 19 1 23 79 78 0 37 24 20 1 89 45 99 0 85 57 80 0 40 7 42 0 32 50 73 0 61 64 50 0 91 22 81 1 91 83 36 0 59 97 8 1 33 84 59 1 85 51 91 1 44 28 20 0 90 74 43 0 4 24 75 0 53 95 4 1 71 62 94 1 18 60 76 0 34 18 56 0 19 9 19 1 32 26 50 1 40 85 52 0 55 91 99 1 5 70 85 1 55 72 96 0 28 23 68 1 24 58 40 0 25 81 93 0 16 40 48 1 95 98 23 1 93 9 40 0 82 32 70 1 73 51 56 1 18 7 75 1 36 72 99 0 19 56 96 0 1 53 53 0 32 83 96 1 70 86 12 0 62 79 6 0 54 32 31 1 44 45 58 1 29 75 53 0 50 11 90 0 76 11 54 0 76 27 43 1 58 52 54 0 75 97 71 0 64 71 2 1 13 31 80 0 50 29 15 1 35 85 48 1 10 91 26 0 15 64 37 0 20 26 66 1 67 9 17 1 43 83 28 1 69 58 20 1 26 94 20 0 1 7 33 1 53 58 88 0 28 29 47 0 94 82 40 0 90 19 18 1 39 44 96 1 3 39 41 1