K-p-Infix codes and semaphore codes
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
|Journal / Publication||Discrete Applied Mathematics|
|Publication status||Published - 15 May 2001|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-0345817113&origin=recordpage|
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.
- Code, Combinatorics of words, Product of languages, Shuffle code