K-p-Infix codes and semaphore codes

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

2 Scopus Citations
Scopus Metrics
View graph of relations

Author(s)

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

Related Research Unit(s)

Detail(s)

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

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0345817113&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(c639ef6e-c7f7-454f-8e40-9a744a536619).html

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

Fingerprint

Publication fingerprints text

100
n codes INIS
100
Class Computer Science
100
Conceptualization Computer Science
100
Semaphore Codes Keyphrases
100
Infix Code Keyphrases
50
operation INIS
50
k codes INIS
40
Suffix Keyphrases
40
Prefix Keyphrases
40
Infix Keyphrases
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
K-p-Infix codes and semaphore codes. / Long, Dongyang; Jia, Weijia; Ma, Jian et al.
In: Discrete Applied Mathematics, Vol. 109, No. 3, 15.05.2001, p. 237-252.

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