Timeline for How to perform AND on binary "recursive repeating sequences"?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2021 at 20:10 | comment | added | Yuval Filmus | If $A = 0011$ then you can take $A_1 = 0$ and $A_2 = 011$. | |
| May 2, 2021 at 18:50 | comment | added | komorra | Sorry, but still I have some troubles getting it right - in some places. For example how A can be of the form A1A2 (in the second sentence of your answer)? I'm trying to imagine it but when I put for A for example 0011 - how it could be A1A2 - in this case it will state that 0011 is equal to 001100110011. Maybe A1 and A2 is just for variable suffix more here , rather than repetition? | |
| May 2, 2021 at 18:24 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
edited body
|
| May 2, 2021 at 18:23 | comment | added | Yuval Filmus | Right, that's exactly what I meant. | |
| May 2, 2021 at 18:22 | comment | added | komorra | Thank you for your answer. If I understood it correctly (notation used here): 1) |x| means the sequence length of expanded whole sequence, 2) AA means concatenated two sequences A for example, 3) lower suffix means number repetitions of sequence - correct me if I am wrong please. | |
| May 2, 2021 at 17:56 | history | answered | Yuval Filmus | CC BY-SA 4.0 |