A Note on Pcodes of Partial Words

Tetsuo MORIYA; Itaru KATAOKA

doi:10.1587/transinf.E97.D.139

A Note on Pcodes of Partial Words

Tetsuo MORIYA, Itaru KATAOKA

Full Text Views

0

Cite this

Summary :

In this paper, we study partial words in relation with pcodes, compatibility, and containment. First, we introduce C_⊂(L), the set of all partial words contained by elements of L, and C_⊃(L), the set of all partial words containing elements of L, for a set L of partial words. We discuss the relation between C(L), the set of all partial words compatible with elements of the set L, C_⊂(L), and C_⊃(L). Next, we consider the condition for C(L), C_⊂(L), and C_⊃(L) to be a pcode when L is a pcode. Furthermore, we introduce some classes of pcodes. An infix pcode and a comma-free pcode are defined, and the inclusion relation among these classes is established.

Publication: IEICE TRANSACTIONS on Information Vol.E97-D No.1 pp.139-141

Publication Date: 2014/01/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E97.D.139

Type of Manuscript: LETTER

Category: Fundamentals of Information Systems

Authors

Tetsuo MORIYA
Kokushikan University
Itaru KATAOKA
Kokushikan University

Keyword

formal language, partial word, pcode, compatible

Cite this

Copy

Tetsuo MORIYA, Itaru KATAOKA, "A Note on Pcodes of Partial Words" in IEICE TRANSACTIONS on Information, vol. E97-D, no. 1, pp. 139-141, January 2014, doi: 10.1587/transinf.E97.D.139.
Abstract: In this paper, we study partial words in relation with pcodes, compatibility, and containment. First, we introduce C_⊂(L), the set of all partial words contained by elements of L, and C_⊃(L), the set of all partial words containing elements of L, for a set L of partial words. We discuss the relation between C(L), the set of all partial words compatible with elements of the set L, C_⊂(L), and C_⊃(L). Next, we consider the condition for C(L), C_⊂(L), and C_⊃(L) to be a pcode when L is a pcode. Furthermore, we introduce some classes of pcodes. An infix pcode and a comma-free pcode are defined, and the inclusion relation among these classes is established.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E97.D.139/_p

Copy

@ARTICLE{e97-d_1_139,
author={Tetsuo MORIYA, Itaru KATAOKA, },
journal={IEICE TRANSACTIONS on Information},
title={A Note on Pcodes of Partial Words},
year={2014},
volume={E97-D},
number={1},
pages={139-141},
abstract={In this paper, we study partial words in relation with pcodes, compatibility, and containment. First, we introduce C_⊂(L), the set of all partial words contained by elements of L, and C_⊃(L), the set of all partial words containing elements of L, for a set L of partial words. We discuss the relation between C(L), the set of all partial words compatible with elements of the set L, C_⊂(L), and C_⊃(L). Next, we consider the condition for C(L), C_⊂(L), and C_⊃(L) to be a pcode when L is a pcode. Furthermore, we introduce some classes of pcodes. An infix pcode and a comma-free pcode are defined, and the inclusion relation among these classes is established.},
keywords={},
doi={10.1587/transinf.E97.D.139},
ISSN={1745-1361},
month={January},}

Copy

TY - JOUR
TI - A Note on Pcodes of Partial Words
T2 - IEICE TRANSACTIONS on Information
SP - 139
EP - 141
AU - Tetsuo MORIYA
AU - Itaru KATAOKA
PY - 2014
DO - 10.1587/transinf.E97.D.139
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2014
AB - In this paper, we study partial words in relation with pcodes, compatibility, and containment. First, we introduce C_⊂(L), the set of all partial words contained by elements of L, and C_⊃(L), the set of all partial words containing elements of L, for a set L of partial words. We discuss the relation between C(L), the set of all partial words compatible with elements of the set L, C_⊂(L), and C_⊃(L). Next, we consider the condition for C(L), C_⊂(L), and C_⊃(L) to be a pcode when L is a pcode. Furthermore, we introduce some classes of pcodes. An infix pcode and a comma-free pcode are defined, and the inclusion relation among these classes is established.
ER -