K-p-Infix codes and semaphore codes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

1 Scopus Citations
View graph of relations

Author(s)

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

Detail(s)

Original languageEnglish
Pages (from-to)237-252
Journal / PublicationDiscrete Applied Mathematics
Volume109
Issue number3
Publication statusPublished - 15 May 2001

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.

Research Area(s)

  • Code, Combinatorics of words, Product of languages, Shuffle code

Citation Format(s)

K-p-Infix codes and semaphore codes. / Long, Dongyang; Jia, Weijia; Ma, Jian; Zhou, Duanning.

In: Discrete Applied Mathematics, Vol. 109, No. 3, 15.05.2001, p. 237-252.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review