@inproceedings{65138f074ecc4140abf5a91e2bc06f4a,
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.",
keywords = "Codes, Context-free languages, Decision algorithms, Marginal errors, Regular languages, Undecidability",
author = "Han, {Yo Sub} and Ko, {Sang Ki} and Kai Salomaa",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 19th International Conference on Developments in Language Theory, DLT 2015 ; Conference date: 27-07-2015 Through 30-07-2015",
year = "2015",
doi = "10.1007/978-3-319-21500-6_21",
language = "English",
isbn = "9783319214993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "264--275",
editor = "Igor Potapov",
booktitle = "Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings",
address = "Germany",
}