Skip to main navigation Skip to search Skip to main content

K-p-Infix codes and semaphore codes

  • Dongyang Long
  • , Weijia Jia
  • , Jian Ma
  • , Duanning Zhou

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

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 languageEnglish
Pages (from-to)237-252
JournalDiscrete Applied Mathematics
Volume109
Issue number3
DOIs
Publication statusPublished - 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