I study the period of algorithms.
Let A be an algorithm. A is "k-periodic" if A^k (A repetead k times) is the equivalent of doing nothing.
For instance, (RUR'U') is 12-periodic, 36-periodic, and its smallest period is 6.
What I'm looking for