Skip to Main content Skip to Navigation
Theses

On Post’s embedding problem and the complexity of lossy channels

Abstract : Lossy channel systems were originally introduced to model communication protocols. It gave birth to a complexity class wich remained scarcely undersood for a long time. In this thesis we study some of the most important gaps. In particular, we bring matching upper and lower bounds for the time complexity. Then we describe a new proof tool : the Post Embedding Problem (PEP) which is a simple problem, closely related to the Post Correspondence Problem, and complete for this complexity class. Finally, we study PEP, its variants and the languages of solutions of PEP on which we provide complexity results and proof tools like pumping lemmas.
Document type :
Theses
Complete list of metadata

Cited literature [53 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00777541
Contributor : ABES STAR :  Contact
Submitted on : Thursday, January 17, 2013 - 4:07:30 PM
Last modification on : Monday, February 15, 2021 - 10:39:41 AM
Long-term archiving on: : Thursday, April 18, 2013 - 4:01:43 AM

File

Chambart2011.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00777541, version 1

Collections

Citation

Pierre Chambart. On Post’s embedding problem and the complexity of lossy channels. Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2011. English. ⟨NNT : 2011DENS0036⟩. ⟨tel-00777541⟩

Share

Metrics

Record views

210

Files downloads

157