On n-power prefix languages

被引：2

作者：

Fan, Chen-Ming ^{[3
]}

Huang, C. C. ^{[2
]}

Yu, S. S. ^{[1
]}

机构：

[1] Natl Chung Hsing Univ, Dept Comp Sci, Taichung 402, Taiwan

[2] Chung Shan Med Univ, Dept Management Informat Syst, Taichung 402, Taiwan

[3] Natl Chin Yi Univ Technol, Dept Informat Syst, Taichung 411, Taiwan

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2008年 / 85卷 / 05期

关键词：

disjunctive; d-primitive; p-primitive; primitive;

D O I：

10.1080/00207160701422829

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A word u is said to be an n-power prefix of another word w if w is an element of u(n) X*. Let P-i denote the family of words which have i-power prefixes but no (i +1)-power prefix. Words in P-1 are called p-primitive words. In this paper, some basic properties of words in sets P-1(i) and Pi are studied. It is shown that the sets P-i, P-i \ Q, P-i boolean AND Q, Q \ P-i, P-1(i) and P-i boolean OR Q for i >= 1 are disjunctive. That is, they are dense non-regular languages. A characterization of words in P-1((I)) for i >= 2 is derived. Several properties of words in P-n \ P-1(n) are considered too.

引用

页码：703 / 715

页数：13

共 50 条

[21] The origin of the reflexive prefix in Rgyalrong languages
Jacques, Guillaume
BULLETIN OF THE SCHOOL OF ORIENTAL AND AFRICAN STUDIES-UNIVERSITY OF LONDON, 2010, 73 : 261 - 268
[22] Prefix-free Lukasiewicz languages
Staiger, Ludwig
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (06) : 1417 - 1423
[23] ON THE CLASS OF n-POWER D-m-QUASI-NORMAL OPERATORS ON HILBERT SPACES
Ahmed, Beinane Sid
Mahmoud, Sid Ahmed Ould Ahmed
OPERATORS AND MATRICES, 2020, 14 (01): : 159 - 174
[24] Two classes of languages related to the prefix codes
Zhang, RH
Cai, YY
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2004, 81 (01) : 1 - 7
[25] Parameterized Prefix Distance between Regular Languages
Kutrib, Martin
Meckel, Katja
Wendlandt, Matthias
SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 419 - 430
[26] An Efficient Algorithm for the Computation of the Controllability Prefix of *-Languages
Moor, Thomas
Schmidt, Klaus Werner
Schmuck, Anne-Kathrin
IFAC PAPERSONLINE, 2020, 53 (02): : 2122 - 2129
[27] Complexity in Prefix-Free Regular Languages
Jiraskova, Galina
Krausova, Monika
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 197 - 204
[28] An Algebraic Characterization of Prefix-Strict Languages
Tian, Jing
Chen, Yizhi
Xu, Hui
MATHEMATICS, 2022, 10 (19)
[29] PREFIX GRAMMARS - AN ALTERNATIVE CHARACTERIZATION OF THE REGULAR LANGUAGES
FRAZIER, M
PAGE, CD
INFORMATION PROCESSING LETTERS, 1994, 51 (02) : 67 - 71
[30] LF DEPENDENCE OF THE OUTPUT ADMITTANCE IN SHORT-CHANNEL N-POWER OR P-POWER MOS-TRANSISTORS
ZUNIGA, MG
TRANDUC, H
PHAM, TP
ROSSEL, P
IEEE TRANSACTIONS ON ELECTRON DEVICES, 1982, 29 (05) : 838 - 841

← 1 2 3 4 5 →