1RB1RF_0LC0RF_1RD1LC_---0LE_0RC1LF_1RA0LE

1RB1RF_0LC0RF_1RD1LC_---0LE_0RC1LF_1RA0LE (bbch) is a BB(6) potential cryptid similar to BMO 1

Analysis

A(x,y,z) = 1^x 0 1^y F> 1^z

A(x,2y,z) -> A(x+4,2y-2,z-2) if y>0 and z>1
A(x,0,z) -> A(0,x+4,z-3) if z>2
A(x,0,1) -> halt
A(x,0,2) -> A(0,x+2,0)
A(2x,y,0) -> A(0,2x+4,y)
A(2x+1,y,0) -> A(4,2x,y) if x>0
A(1,y,0) -> A(4,0,y+1)
A(x,2y,1) -> A(x+4,2y-4,0) if y>1
A(x,2,1) -> A(0,4,x+2)
A(x,2y+1,1) -> A(0,x+2y+2,0)
A(x,2y+1,z) -> A(0,x+2y+4,z-2) if z>1

The A(2x+1,y,0) and A(1,y,0) rules are unreachable from the start(reaching them requires odd x)

B(x,y) = A(0,x,y)

B(2x,2y) -> B(4y+4,2x-2y) if x>=y
B(2x,2y) -> B(4x+4,2y-2x-3) if x<y-1
B(2x,2x+2) -> B(4x+2,0)
B(2x,2y+1) -> B(4y+8,2x-2y-4) if x>y+1
B(2x+2,2x+1) -> B(4,4x+2)
B(2x,2y+1) -> B(4x+4,2y-2x-2) if x<y
B(2x,2x+1) -> halt
B(2x+1,2y) -> B(4y+4,2x-2y+1) if x>=y
B(2x+1,2y) -> B(4x+4,2y-2x-2) if x<y
B(2x+1,2y+1) -> B(2x+2y+2,0) if x>=y
B(2x+1,2y+1) -> B(4x+4,2y-2x-1) if x<y

The B(2x+1,y) rules can only be reached if they are the start

B(2,0) -> B(4,2) -> B(8,2) -> B(8,6) -> B(16,2) -> B(8,14) -> B(20,3) -> B(12,14) -> B(26,0) -> B(4,26) -> B(12,19) -> B(28,4) -> B(12,24) -> B(28,9) -> B(24,16) -> B(36,8) -> B(20,28) -> B(44,5) -> B(16,36) -> B(36,17) -> B(40,16) -> B(36,24) -> ...