Generalizations of code languages with marginal errors

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k-prefix-free, k-suffix-free or k-infix-free, and analyze their runtime. Lastly, we establish the undecidability results for (linear) context-free languages.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 19th International Conference, DLT 2015, Proceedings
PublisherSpringer Verlag
Pages264-275
Number of pages12
Volume9168
ISBN (Print)9783319214993
DOIs
Publication statusPublished - 2015 Jan 1
Event19th International Conference on Developments in Language Theory, DLT 2015 - Liverpool, United Kingdom
Duration: 2015 Jul 272015 Jul 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9168
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Developments in Language Theory, DLT 2015
CountryUnited Kingdom
CityLiverpool
Period15/7/2715/7/30

Fingerprint

Prefix-free
Suffix
Context free languages
Strings
Formal languages
Prefix
Context-free Languages
Undecidability
Regular Languages
Efficient Algorithms
Generalization
Language
Generalise

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Ko, S. K., & Salomaa, K. (2015). Generalizations of code languages with marginal errors. In Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings (Vol. 9168, pp. 264-275). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9168). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_21
Han, Yo Sub ; Ko, Sang Ki ; Salomaa, Kai. / Generalizations of code languages with marginal errors. Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Vol. 9168 Springer Verlag, 2015. pp. 264-275 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{127d4119207642fb856233bd7583a530,
title = "Generalizations of code languages with marginal errors",
abstract = "We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k-prefix-free, k-suffix-free or k-infix-free, and analyze their runtime. Lastly, we establish the undecidability results for (linear) context-free languages.",
author = "Han, {Yo Sub} and Ko, {Sang Ki} and Kai Salomaa",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-21500-6_21",
language = "English",
isbn = "9783319214993",
volume = "9168",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "264--275",
booktitle = "Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings",
address = "Germany",

}

Han, YS, Ko, SK & Salomaa, K 2015, Generalizations of code languages with marginal errors. in Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. vol. 9168, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9168, Springer Verlag, pp. 264-275, 19th International Conference on Developments in Language Theory, DLT 2015, Liverpool, United Kingdom, 15/7/27. https://doi.org/10.1007/978-3-319-21500-6_21

Generalizations of code languages with marginal errors. / Han, Yo Sub; Ko, Sang Ki; Salomaa, Kai.

Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Vol. 9168 Springer Verlag, 2015. p. 264-275 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9168).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Generalizations of code languages with marginal errors

AU - Han, Yo Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k-prefix-free, k-suffix-free or k-infix-free, and analyze their runtime. Lastly, we establish the undecidability results for (linear) context-free languages.

AB - We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k-prefix-free, k-suffix-free or k-infix-free, and analyze their runtime. Lastly, we establish the undecidability results for (linear) context-free languages.

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

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

U2 - 10.1007/978-3-319-21500-6_21

DO - 10.1007/978-3-319-21500-6_21

M3 - Conference contribution

SN - 9783319214993

VL - 9168

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 264

EP - 275

BT - Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings

PB - Springer Verlag

ER -

Han YS, Ko SK, Salomaa K. Generalizations of code languages with marginal errors. In Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Vol. 9168. Springer Verlag. 2015. p. 264-275. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-21500-6_21