Coordination through De Bruijn sequences

Authors:
Olivier Gossner;PenéLope HernáNdez
Affiliations:
Paris-Jourdan Sciences íconomiques, UMR CNRS - EHESS - ENPC - ENS 8545, 48 boulevard Jourdan, 75014 Paris, France;Departmento Fundamentos del Análisis Económico, Universidad de Alicante, Carretera de San Vicente s/n, 03080 San Vicente, Alicante, Spain
Venue:
Operations Research Letters
Year:
2006

Citing 2
Cited 0

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
On the complexity of coordination

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let (x"t) be an n-periodic sequence in which the first n elements are drawn i.i.d.according to some rational distribution. We prove there exists a constant C such that whenever mlnm=Cn, with probability close to 1, there exists an automaton of size m that matches the sequence at almost all stages.