CORR
2008
Springer
13 years 2 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
ML
2000
ACM
13 years 4 months ago
2000
ACM
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
WSC
2004
13 years 5 months ago
2004
We examine properties of overlapped versions of the standardized time series area and Cram
COMPLEX
2009
Springer
13 years 8 months ago
2009
Springer
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...