Abstract
It is known, that an -machine is either exactly or asymptotically synchronizing. In the exact case, the observer can infer the current machine state after observing generated symbols with probability where is a so-called synchronization rate constant. In the asymptotic case, the probability of the correct prediction the current machine state after observing generated symbols tends to exponentially fast as for and the infimum of such is a so-called prediction rate constant. Hence the synchronization and prediction rate constants serve as natural measures of synchronization for -machines. In the present work we show how to approximate these constants in polynomial time in terms of the number of machine states.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.