Infinite Communication Complexity

Abstract : Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it satisfies some natural properties and coincides, for relevant applications, with the classical notion of amortized communication complexity. More-over, an application is given for tackling some conjecture about tilings and multidimensional sofic shifts.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01108690
Contributor : Emmanuel Jeandel <>
Submitted on : Friday, January 23, 2015 - 11:58:32 AM
Last modification on : Saturday, March 30, 2019 - 1:26:32 AM
Document(s) archivé(s) le : Friday, April 24, 2015 - 10:22:14 AM

Files

comm.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01108690, version 1

Citation

Pierre Guillon, Emmanuel Jeandel. Infinite Communication Complexity. 2014. ⟨hal-01108690⟩

Share

Metrics

Record views

480

Files downloads

141