• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Conjugacy of Finite Biprefix Codes

Julien Cassaigne, Juhani Karhumäki, Petri Salmela, Conjugacy of Finite Biprefix Codes. Theoretical Computer Science 410(24-25), 2345–2351, 2009.

http://dx.doi.org/10.1016/j.tcs.2009.02.030

Abstract:

Two languages X and Y are called conjugates, if they satisfy the conjugacy equation XZ=ZY for some non-empty language Z. We will compare solutions of this equation with those of the corresponding equation of words and study the case of finite biprefix codes X and Y. We show that the maximal Z in this case is rational. We will also characterize X and Y in the case where they are both finite biprefix codes. This yields the decidability of the conjugacy of two finite biprefix codes.

BibTeX entry:

@ARTICLE{jCaKaSa09a,
  title = {Conjugacy of Finite Biprefix Codes},
  author = {Cassaigne, Julien and Karhumäki, Juhani and Salmela, Petri},
  journal = {Theoretical Computer Science},
  volume = {410},
  number = {24-25},
  pages = {2345–2351},
  year = {2009},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication