- FindStat

Identifier

Mp00268: Binary words —zeros to flag zeros⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words

Images

0 => 0 => 1 => 1

1 => 1 => 0 => 0

00 => 10 => 01 => 10

01 => 00 => 11 => 11

10 => 01 => 10 => 00

11 => 11 => 00 => 01

000 => 010 => 101 => 100

001 => 110 => 001 => 101

010 => 100 => 011 => 110

011 => 000 => 111 => 111

100 => 101 => 010 => 000

101 => 001 => 110 => 001

110 => 011 => 100 => 010

111 => 111 => 000 => 011

0000 => 1010 => 0101 => 1000

0001 => 0010 => 1101 => 1001

0010 => 0110 => 1001 => 1010

0011 => 1110 => 0001 => 1011

0100 => 0100 => 1011 => 1100

0101 => 1100 => 0011 => 1101

0110 => 1000 => 0111 => 1110

0111 => 0000 => 1111 => 1111

1000 => 0101 => 1010 => 0000

1001 => 1101 => 0010 => 0001

1010 => 1001 => 0110 => 0010

1011 => 0001 => 1110 => 0011

1100 => 1011 => 0100 => 0100

1101 => 0011 => 1100 => 0101

1110 => 0111 => 1000 => 0110

1111 => 1111 => 0000 => 0111

00000 => 01010 => 10101 => 10000

00001 => 11010 => 00101 => 10001

00010 => 10010 => 01101 => 10010

00011 => 00010 => 11101 => 10011

00100 => 10110 => 01001 => 10100

00101 => 00110 => 11001 => 10101

00110 => 01110 => 10001 => 10110

00111 => 11110 => 00001 => 10111

01000 => 10100 => 01011 => 11000

01001 => 00100 => 11011 => 11001

01010 => 01100 => 10011 => 11010

01011 => 11100 => 00011 => 11011

01100 => 01000 => 10111 => 11100

01101 => 11000 => 00111 => 11101

01110 => 10000 => 01111 => 11110

01111 => 00000 => 11111 => 11111

10000 => 10101 => 01010 => 00000

10001 => 00101 => 11010 => 00001

10010 => 01101 => 10010 => 00010

10011 => 11101 => 00010 => 00011

10100 => 01001 => 10110 => 00100

10101 => 11001 => 00110 => 00101

10110 => 10001 => 01110 => 00110

10111 => 00001 => 11110 => 00111

11000 => 01011 => 10100 => 01000

11001 => 11011 => 00100 => 01001

11010 => 10011 => 01100 => 01010

11011 => 00011 => 11100 => 01011

11100 => 10111 => 01000 => 01100

11101 => 00111 => 11000 => 01101

11110 => 01111 => 10000 => 01110

11111 => 11111 => 00000 => 01111

000000 => 101010 => 010101 => 100000

000001 => 001010 => 110101 => 100001

000010 => 011010 => 100101 => 100010

000011 => 111010 => 000101 => 100011

000100 => 010010 => 101101 => 100100

000101 => 110010 => 001101 => 100101

000110 => 100010 => 011101 => 100110

000111 => 000010 => 111101 => 100111

001000 => 010110 => 101001 => 101000

001001 => 110110 => 001001 => 101001

001010 => 100110 => 011001 => 101010

001011 => 000110 => 111001 => 101011

001100 => 101110 => 010001 => 101100

001101 => 001110 => 110001 => 101101

001110 => 011110 => 100001 => 101110

001111 => 111110 => 000001 => 101111

010000 => 010100 => 101011 => 110000

010001 => 110100 => 001011 => 110001

010010 => 100100 => 011011 => 110010

010011 => 000100 => 111011 => 110011

010100 => 101100 => 010011 => 110100

010101 => 001100 => 110011 => 110101

010110 => 011100 => 100011 => 110110

010111 => 111100 => 000011 => 110111

011000 => 101000 => 010111 => 111000

011001 => 001000 => 110111 => 111001

011010 => 011000 => 100111 => 111010

011011 => 111000 => 000111 => 111011

011100 => 010000 => 101111 => 111100

011101 => 110000 => 001111 => 111101

011110 => 100000 => 011111 => 111110

011111 => 000000 => 111111 => 111111

100000 => 010101 => 101010 => 000000

100001 => 110101 => 001010 => 000001

100010 => 100101 => 011010 => 000010

100011 => 000101 => 111010 => 000011

100100 => 101101 => 010010 => 000100

100101 => 001101 => 110010 => 000101

100110 => 011101 => 100010 => 000110

>>> Load all 1308 entries. <<<

Map

zeros to flag zeros

Description

Return a binary word of the same length, such that the number of occurrences of $10$ in the word obtained by prepending the reverse of the complement equals the number of $0$s in the original word.
For example, the image of the word $w=1\dots1$ is $1\dots1$, because $w$ has no zeros, and $1\dots1$ is the only word such that prepending the reverse of its complement has no occurrence of the factor $10$.
On the other hand, $0\dots0$ must be mapped to $10\dots10$ if the length is even, and $010\dots10$ if it is odd.

Map

complement

Description

Send a binary word to the word obtained by interchanging the two letters.

Map

flag zeros to zeros

Description

Return a binary word of the same length, such that the number of zeros equals the number of occurrences of $10$ in the word obtained from the original word by prepending the reverse of the complement.
For example, the image of the word $w=1\dots 1$ is $1\dots 1$, because $0\dots 01\dots 1$ has no occurrences of $10$. The words $10\dots 10$ and $010\dots 10$ have image $0\dots 0$.