How can I enumerate binary strings up to rotation without duplicates?
I want an algorithm that generates one representative for every binary string of a fixed length, treating strings as equivalent when one can be obtained from the other…
I want an algorithm that generates one representative for every binary string of a fixed length, treating strings as equivalent when one can be obtained from the other…