{"paper":{"title":"On the Synchronization Rate for e-machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL","math.IT"],"primary_cat":"cs.IT","authors_text":"Mikhail V. Berlinkov","submitted_at":"2014-06-28T06:55:37Z","abstract_excerpt":"It is known, that an $\\epsilon$-machine is either exactly or asymptotically synchronizing. In the exact case, the observer can infer the current machine state after observing $L$ generated symbols with probability $1-a^L$ where $0 \\leq a<1$ is a so-called synchronization rate constant. In the asymptotic case, the probability of the correct prediction the current machine state after observing $L$ generated symbols tends to $1$ exponentially fast as $1-b^L$ for $0<b<1$ and the infimum of such $b$ is a so-called prediction rate constant.\n  Hence the synchronization and prediction rate constants s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7363","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}