Learning Cycle Length through Finite Automata
We study the space-and-time automaton-complexity of the CYCLE-LENGTH problem. The input is a periodic stream of bits whose cycle length is bounded by a known number n. The output, a number between 1 and n, is the exact cycle length. We also study a related problem, CYCLE-DIVISOR. In the latter problem the output is a large number that divides the cycle length, that is, a number k >> 1 that divides the cycle length, or (in case the cycle length is small) the cycle length itself. The complexity is measured in terms of the SPACE, the logarithm of the number of states in an automaton that solves the problem, and the TIME required to reach a terminal state. We analyze the worst input against a deterministic (pure) automaton, and against a probabilistic (mixed) automaton. In the probabilistic case we require that the probability of computing a correct output is arbitrarily close to one. We establish the following results: o CYCLE-DIVISOR can be solved in deterministic SPACE o(n), and TIME O(n). o CYCLE-LENGTH cannot be solved in deterministic SPACE X TIME smaller than (n^2). o CYCLE-LENGTH can be solved in probabilistic SPACE o(n), and TIME O(n). o CYCLE-LENGTH can be solved in deterministic SPACE O(nL), and TIME O(n/L), for any positive L
|Date of creation:||Apr 2010|
|Contact details of provider:|| Postal: Feldman Building - Givat Ram - 91904 Jerusalem|
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Abraham Neyman, 2008.
"Learning Effectiveness and Memory Size,"
Levine's Working Paper Archive
122247000000002427, David K. Levine.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Discussion Paper Series dp476, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000001945, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp546. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tomer Siedner)
If references are entirely missing, you can add them using this form.