The exact factor-complexity formula for the (3/2)^n steering word
Statement
Let be the steering word considered in the paper, and let denote the number of distinct factors of length occurring in . Exact complexity conjecture.
The formula agrees with the measured complexity profile for small and predicts the exact number of factors at every length. The paper presents it as conjectural; in particular, the available computation is finite and does not establish the assertion for all .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.