Recognition of a numerical sequence that includes series of quasiperiodically repeating standard fragments. (Russian) Zbl 1224.93111
Summary: An a-posteriori (off-line) approach is considered to the solution of the problem of the recognition of a numerical sequence in which there are series of quasiperiodically repeating standard fragments (subsequences). A solution of the problem is presented for the case when the number of fragments in a sequence is not known. An efficient algorithm is justified which ensures a decision based on the criterion of maximum likelihood. Estimates for the time and capacity complexities are connected with the parameters of the problem. Results of numerical simulation are given.
MSC:
| 93E10 | Estimation and detection in stochastic control theory |
| 60G35 | Signal detection and filtering (aspects of stochastic processes) |
| 94A45 | Prefix, length-variable, comma-free codes |
| 94A12 | Signal theory (characterization, reconstruction, filtering, etc.) |
| 62L10 | Sequential statistical analysis |
