Let µ be a rational distribution over a finite alphabet, and ( ) be a n-periodic sequences which first n elements are drawn i.i.d. according to µ. We consider automata of bounded size that input and output at stage t. We prove the existence of a constant C such that, whenever , with probability close to 1 there exists an automaton of size m such that the empirical frequency of stages such that is close to 1. In particular, one can take , where and .
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie) in its series Working Papers. Serie AD with number
2005-05.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
O. Gossner & P. Hernandez, 2001.
"On the complexity of coordination,"
THEMA Working Papers
2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
[Downloadable!]
Other versions:
GOSSNER, Olivier & HERNANDEZ, PŽnŽlope, 2001.
"On the complexity of coordination,"
CORE Discussion Papers
2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
[Downloadable!]