Decidability of involution hypercodes

Da Jung Cho, Yo Sub Han, Sang Ki Ko

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Given a finite set X of strings, X is a hypercode if a string in X is not a subsequence of any other string in X. We consider hypercodes for involution codes, which are useful for DNA strand design, and define an involution hypercode. We then tackle the involution hypercode decidability problem; that is, to determine whether or not a given language is an involution hypercode. Based on the hypercode properties, we design a polynomial runtime algorithm for regular languages. We also prove that it is decidable whether or not a context-free language is an involution hypercode. Note that it is undecidable for some other involution codes such as involution prefix codes, suffix codes, and k-intercodes.

Original languageEnglish
Pages (from-to)90-99
Number of pages10
JournalTheoretical Computer Science
Volume550
Issue numberC
DOIs
Publication statusPublished - 2014

Bibliographical note

Funding Information:
This research was supported by the Basic Science Research Program through NRF funded by MEST ( 2012R1A1A2044562 ).

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Decidability of involution hypercodes'. Together they form a unique fingerprint.

Cite this