Abstract
In this paper we introduce the concepts of k-p-infix codes, n-k-ps-infix languages, n-k-infix-outfix codes, and n-k-prefix-suffix languages, which are natural generalizations of our previous work on k-prefix codes, k-infix codes and so on. We obtain several properties of k-p-infix codes and semaphore codes. The relations and hierarchies of k-p-infix codes, n-k-ps-languages, and n-k-prefix-suffix languages, and their operations of these classes of languages are also investigated. © 2001 Elsevier Science B.V.
| Original language | English |
|---|---|
| Pages (from-to) | 237-252 |
| Journal | Discrete Applied Mathematics |
| Volume | 109 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 15 May 2001 |
Research Keywords
- Code
- Combinatorics of words
- Product of languages
- Shuffle code
Fingerprint
Dive into the research topics of 'K-p-Infix codes and semaphore codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver