- FindStat

Identifier

Mp00269: Binary words —flag zeros to zeros⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00200: Binary words —twist⟶ Binary words

Images

0 => 0 => 1 => 0

1 => 1 => 0 => 1

00 => 01 => 10 => 00

01 => 10 => 01 => 11

10 => 00 => 11 => 01

11 => 11 => 00 => 10

000 => 011 => 100 => 000

001 => 101 => 010 => 110

010 => 000 => 111 => 011

011 => 110 => 001 => 101

100 => 010 => 101 => 001

101 => 100 => 011 => 111

110 => 001 => 110 => 010

111 => 111 => 000 => 100

0000 => 0111 => 1000 => 0000

0001 => 1011 => 0100 => 1100

0010 => 0001 => 1110 => 0110

0011 => 1101 => 0010 => 1010

0100 => 0100 => 1011 => 0011

0101 => 1000 => 0111 => 1111

0110 => 0010 => 1101 => 0101

0111 => 1110 => 0001 => 1001

1000 => 0110 => 1001 => 0001

1001 => 1010 => 0101 => 1101

1010 => 0000 => 1111 => 0111

1011 => 1100 => 0011 => 1011

1100 => 0101 => 1010 => 0010

1101 => 1001 => 0110 => 1110

1110 => 0011 => 1100 => 0100

1111 => 1111 => 0000 => 1000

00000 => 01111 => 10000 => 00000

00001 => 10111 => 01000 => 11000

00010 => 00011 => 11100 => 01100

00011 => 11011 => 00100 => 10100

00100 => 01001 => 10110 => 00110

00101 => 10001 => 01110 => 11110

00110 => 00101 => 11010 => 01010

00111 => 11101 => 00010 => 10010

01000 => 01100 => 10011 => 00011

01001 => 10100 => 01011 => 11011

01010 => 00000 => 11111 => 01111

01011 => 11000 => 00111 => 10111

01100 => 01010 => 10101 => 00101

01101 => 10010 => 01101 => 11101

01110 => 00110 => 11001 => 01001

01111 => 11110 => 00001 => 10001

10000 => 01110 => 10001 => 00001

10001 => 10110 => 01001 => 11001

10010 => 00010 => 11101 => 01101

10011 => 11010 => 00101 => 10101

10100 => 01000 => 10111 => 00111

10101 => 10000 => 01111 => 11111

10110 => 00100 => 11011 => 01011

10111 => 11100 => 00011 => 10011

11000 => 01101 => 10010 => 00010

11001 => 10101 => 01010 => 11010

11010 => 00001 => 11110 => 01110

11011 => 11001 => 00110 => 10110

11100 => 01011 => 10100 => 00100

11101 => 10011 => 01100 => 11100

11110 => 00111 => 11000 => 01000

11111 => 11111 => 00000 => 10000

000000 => 011111 => 100000 => 000000

000001 => 101111 => 010000 => 110000

000010 => 000111 => 111000 => 011000

000011 => 110111 => 001000 => 101000

000100 => 010011 => 101100 => 001100

000101 => 100011 => 011100 => 111100

000110 => 001011 => 110100 => 010100

000111 => 111011 => 000100 => 100100

001000 => 011001 => 100110 => 000110

001001 => 101001 => 010110 => 110110

001010 => 000001 => 111110 => 011110

001011 => 110001 => 001110 => 101110

001100 => 010101 => 101010 => 001010

001101 => 100101 => 011010 => 111010

001110 => 001101 => 110010 => 010010

001111 => 111101 => 000010 => 100010

010000 => 011100 => 100011 => 000011

010001 => 101100 => 010011 => 110011

010010 => 000100 => 111011 => 011011

010011 => 110100 => 001011 => 101011

010100 => 010000 => 101111 => 001111

010101 => 100000 => 011111 => 111111

010110 => 001000 => 110111 => 010111

010111 => 111000 => 000111 => 100111

011000 => 011010 => 100101 => 000101

011001 => 101010 => 010101 => 110101

011010 => 000010 => 111101 => 011101

011011 => 110010 => 001101 => 101101

011100 => 010110 => 101001 => 001001

011101 => 100110 => 011001 => 111001

011110 => 001110 => 110001 => 010001

011111 => 111110 => 000001 => 100001

100000 => 011110 => 100001 => 000001

100001 => 101110 => 010001 => 110001

100010 => 000110 => 111001 => 011001

100011 => 110110 => 001001 => 101001

100100 => 010010 => 101101 => 001101

100101 => 100010 => 011101 => 111101

100110 => 001010 => 110101 => 010101

>>> Load all 1667 entries. <<<

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$ .

Map

complement

Description

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

Map

twist

Description

Return the binary word with first letter inverted.