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 language | English |
|---|---|
| Title of host publication | Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings |
| Editors | Igor Potapov |
| Publisher | Springer Verlag |
| Pages | 264-275 |
| Number of pages | 12 |
| ISBN (Print) | 9783319214993 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 19th International Conference on Developments in Language Theory, DLT 2015 - Liverpool, United Kingdom Duration: 2015 Jul 27 → 2015 Jul 30 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9168 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 19th International Conference on Developments in Language Theory, DLT 2015 |
|---|---|
| Country | United Kingdom |
| City | Liverpool |
| Period | 15/7/27 → 15/7/30 |
Bibliographical note
Publisher Copyright:© Springer International Publishing Switzerland 2015.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)