Prediction with Restricted Resources and Finite Automata

Details Prediction with Restricted Resources and Finite Automata Prediction with Restricted Resources and Finite Automata

2008-12-10

arxiv.org/abs/0812.1949v1

Statistics

Machine Learning

13 pages

Scientific paper

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state automata with a specified number, $m$, of states to the set of all binary sequences. Thus we can index the complexity of our random sequence by the number of states of the automata. We detail optimal algorithms to predict sequences generated in this way.

Affiliated with

Also associated with

No associations

Rating

Prediction with Restricted Resources and Finite Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prediction with Restricted Resources and Finite Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prediction with Restricted Resources and Finite Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528128