Estimating the Lengths of Memory Words
| dc.creator | Morvai, Gusztav | |
| dc.creator | Weiss, Benjamin | |
| dc.date | 2008-08-21 | |
| dc.date.accessioned | 2026-07-07T09:57:42Z | |
| dc.date.available | 2026-07-07T09:57:42Z | |
| dc.description | For a stationary stochastic process $\{X_n\}$ with values in some set $A$, a finite word $w \in A^K$ is called a memory word if the conditional probability of $X_0$ given the past is constant on the cylinder set defined by $X_{-K}^{-1}=w$. It is a called a minimal memory word if no proper suffix of $w$ is also a memory word. For example in a $K$-step Markov processes all words of length $K$ are memory words but not necessarily minimal. We consider the problem of determining the lengths of the longest minimal memory words and the shortest memory words of an unknown process $\{X_n\}$ based on sequentially observing the outputs of a single sample $\{ξ_1,ξ_2,...ξ_n\}$. We will give a universal estimator which converges almost surely to the length of the longest minimal memory word and show that no such universal estimator exists for the length of the shortest memory word. The alphabet $A$ may be finite or countable. | |
| dc.identifier | https://arxiv.org/abs/0808.2964 | |
| dc.identifier | http://arxiv.org/abs/0808.2964 | |
| dc.identifier | IEEE Transactions on Information Theory, Vol. 54, No. 8. (2008), pp. 3804-3807 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167444 | |
| dc.subject | Information Theory | |
| dc.title | Estimating the Lengths of Memory Words | |
| dc.type | text |