Overlap-free languages and solid codes

Yo Sub Han, Kai Salomaa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Solid codes have a nice property called synchronization property, which is useful in data transmission. The property is derived from infix-freeness and overlap-freeness of solid codes. Since a code is a language, we look at solid codes from formal language viewpoint. In particular, we study regular solid codes (that are solid codes and regular). We first tackle the solid code decidability problem for regular languages and propose a polynomial time algorithm. We, then, investigate the decidability of the overlap-freeness property and show that it is decidable for regular languages but is undecidable for context-free languages. Then, we study the prime solid code decomposition of regular solid codes and propose an efficient algorithm for the prime solid code decomposition problem. We also demonstrate that a solid code does not always have a unique prime solid code decomposition.

Original languageEnglish
Pages (from-to)1197-1209
Number of pages13
JournalInternational Journal of Foundations of Computer Science
Volume22
Issue number5
DOIs
Publication statusPublished - 2011 Aug 1

Fingerprint

Formal languages
Computability and decidability
Decomposition
Context free languages
Data communication systems
Synchronization
Polynomials

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@article{9053f615ee1c4fca989cefc9870037dc,
title = "Overlap-free languages and solid codes",
abstract = "Solid codes have a nice property called synchronization property, which is useful in data transmission. The property is derived from infix-freeness and overlap-freeness of solid codes. Since a code is a language, we look at solid codes from formal language viewpoint. In particular, we study regular solid codes (that are solid codes and regular). We first tackle the solid code decidability problem for regular languages and propose a polynomial time algorithm. We, then, investigate the decidability of the overlap-freeness property and show that it is decidable for regular languages but is undecidable for context-free languages. Then, we study the prime solid code decomposition of regular solid codes and propose an efficient algorithm for the prime solid code decomposition problem. We also demonstrate that a solid code does not always have a unique prime solid code decomposition.",
author = "Han, {Yo Sub} and Kai Salomaa",
year = "2011",
month = "8",
day = "1",
doi = "10.1142/S0129054111008647",
language = "English",
volume = "22",
pages = "1197--1209",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

Overlap-free languages and solid codes. / Han, Yo Sub; Salomaa, Kai.

In: International Journal of Foundations of Computer Science, Vol. 22, No. 5, 01.08.2011, p. 1197-1209.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Overlap-free languages and solid codes

AU - Han, Yo Sub

AU - Salomaa, Kai

PY - 2011/8/1

Y1 - 2011/8/1

N2 - Solid codes have a nice property called synchronization property, which is useful in data transmission. The property is derived from infix-freeness and overlap-freeness of solid codes. Since a code is a language, we look at solid codes from formal language viewpoint. In particular, we study regular solid codes (that are solid codes and regular). We first tackle the solid code decidability problem for regular languages and propose a polynomial time algorithm. We, then, investigate the decidability of the overlap-freeness property and show that it is decidable for regular languages but is undecidable for context-free languages. Then, we study the prime solid code decomposition of regular solid codes and propose an efficient algorithm for the prime solid code decomposition problem. We also demonstrate that a solid code does not always have a unique prime solid code decomposition.

AB - Solid codes have a nice property called synchronization property, which is useful in data transmission. The property is derived from infix-freeness and overlap-freeness of solid codes. Since a code is a language, we look at solid codes from formal language viewpoint. In particular, we study regular solid codes (that are solid codes and regular). We first tackle the solid code decidability problem for regular languages and propose a polynomial time algorithm. We, then, investigate the decidability of the overlap-freeness property and show that it is decidable for regular languages but is undecidable for context-free languages. Then, we study the prime solid code decomposition of regular solid codes and propose an efficient algorithm for the prime solid code decomposition problem. We also demonstrate that a solid code does not always have a unique prime solid code decomposition.

UR - http://www.scopus.com/inward/record.url?scp=80051674239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051674239&partnerID=8YFLogxK

U2 - 10.1142/S0129054111008647

DO - 10.1142/S0129054111008647

M3 - Article

AN - SCOPUS:80051674239

VL - 22

SP - 1197

EP - 1209

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 5

ER -