Generalizations of Code Languages with Marginal Errors

Sang Ki Ko, Yo Sub Han, Kai Salomaa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

The k-prefix-free, k-suffix-free and k-infix-free languages generalize the 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. 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 the time complexity of the algorithms. We establish undecidability results for deciding these properties for (linear) context-free languages.

Original languageEnglish
Article number2141005
Pages (from-to)509-529
Number of pages21
JournalInternational Journal of Foundations of Computer Science
Volume32
Issue number5
DOIs
Publication statusPublished - 2021 Aug

Bibliographical note

Funding Information:
Ko was supported by 2020 Research Grant from Kangwon National University. Han was supported by the National Research Foundation of Korea Grant (NRF-2020R1A4A3079947). Salomaa was supported by NSERC grant OGP0147224.

Publisher Copyright:
© 2021 World Scientific Publishing Co. Pte Ltd. All rights reserved.

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Fingerprint

Dive into the research topics of 'Generalizations of Code Languages with Marginal Errors'. Together they form a unique fingerprint.

Cite this