K-p-Infix codes and semaphore codes

doi:10.1016/S0166-218X(00)00260-2

科研成果详情

发表状态	已发表Published
题名	K-p-Infix codes and semaphore codes
作者	Long, Dongyang 1; Jia, Weijia1 ; Ma, Jian 2; Zhou, Duanning 2
发表日期	2001
发表期刊	Discrete Applied Mathematics
ISSN/eISSN	0166-218X
卷号	109 期号:3 页码:237-252
摘要	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
DOI	10.1016/S0166-218X(00)00260-2
URL	查看来源
收录类别	SCIE
语种	英语English
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000167588200004
引用统计	被引频次：3[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/2013
专题	个人在本单位外知识产出
通讯作者	Long, Dongyang
作者单位	1.Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong 2.Department of Information Systems, City University of Hong Kong, Kowloon, Hong Kong
推荐引用方式 GB/T 7714	Long, Dongyang,Jia, Weijia,Ma, Jianet al. K-p-Infix codes and semaphore codes[J]. Discrete Applied Mathematics, 2001, 109(3): 237-252.
APA	Long, Dongyang, Jia, Weijia, Ma, Jian, & Zhou, Duanning. (2001). K-p-Infix codes and semaphore codes. Discrete Applied Mathematics, 109(3), 237-252.
MLA	Long, Dongyang,et al."K-p-Infix codes and semaphore codes". Discrete Applied Mathematics 109.3(2001): 237-252.