n= 1  bijection=True  equivariant(right)=True  mismatches: left automaton 6, b<->c swapped 4
n= 2  bijection=True  equivariant(right)=True  mismatches: left automaton 12, b<->c swapped 8
n= 3  bijection=True  equivariant(right)=True  mismatches: left automaton 24, b<->c swapped 16
n= 4  bijection=True  equivariant(right)=True  mismatches: left automaton 48, b<->c swapped 32
n= 5  bijection=True  equivariant(right)=True  mismatches: left automaton 96, b<->c swapped 64
n= 6  bijection=True  equivariant(right)=True  mismatches: left automaton 192, b<->c swapped 128
n= 7  bijection=True  equivariant(right)=True  mismatches: left automaton 384, b<->c swapped 256
n= 8  bijection=True  equivariant(right)=True  mismatches: left automaton 768, b<->c swapped 512
n= 9  bijection=True  equivariant(right)=True  mismatches: left automaton 1536, b<->c swapped 1024
n=10  bijection=True  equivariant(right)=True  mismatches: left automaton 3072, b<->c swapped 2048
n=11  bijection=True  equivariant(right)=True  mismatches: left automaton 6144, b<->c swapped 4096
n=12  bijection=True  equivariant(right)=True  mismatches: left automaton 12288, b<->c swapped 8192
n=13  bijection=True  equivariant(right)=True  mismatches: left automaton 24576, b<->c swapped 16384
n=14  bijection=True  equivariant(right)=True  mismatches: left automaton 49152, b<->c swapped 32768
PASS kappa_n bijective for n <= 14
PASS kappa prefix-compatible for n < 14
PASS kappa_n(s(w)) = M_s(kappa_n(w)) for s=a,b,c, all words of length <= 14 (right automaton)
PASS negative control: left (Aleshin) automaton fails at every n >= 2
PASS negative control: matrices of b and c exchanged fail at every n >= 2
PASS negative control: composing the h_x in the opposite order fails (n=8, 514 mismatches)
PASS Lemma 2.1(b): hat s = tau o s on level 10
PASS Lemma 2.1(b): tau hat s tau hat s = 1 on level 10
PASS a, b, c are involutions on level 10
PASS a, b, c are distinct and non-trivial on level 10

SUMMARY r2_3_coding: 0 failed
