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
关键词
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 条
  • [31] Some Results on the Classes of D-normal Operators and n-power D-normal Operators
    M. Dana
    R. Yousefi
    Results in Mathematics, 2019, 74
  • [32] Research to the N-Power: The Strengths of Networked Clinical Collaboration in Spain (vol 112, pg 1761, 2017)
    McNicholl, Adrian G.
    Gisbert, Javier P.
    AMERICAN JOURNAL OF GASTROENTEROLOGY, 2018, 113 (02): : 311 - 311
  • [33] Some Results on the Classes of D-normal Operators and n-power D-normal Operators
    Dana, M.
    Yousefi, R.
    RESULTS IN MATHEMATICS, 2019, 74 (01)
  • [34] N-POWER EXCHANGE FUNCTION - GENERAL-MODEL FOR METAL ADSORPTION ONTO GEOLOGICAL-MATERIALS
    LANGMUIR, D
    OZSVATH, D
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1980, 179 (MAR): : 13 - COLL
  • [35] THE POWER OF PARALLEL PREFIX
    KRUSKAL, CP
    RUDOLPH, L
    SNIR, M
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) : 965 - 968
  • [36] Homomorphisms Preserve Some Languages Related to Prefix Codes
    Cao Chunhua
    Geng Jingrong
    Yang Di
    Sha Li
    HIGH PERFORMANCE NETWORKING, COMPUTING, AND COMMUNICATION SYSTEMS, 2011, 163 : 257 - +
  • [37] Complexity of proper prefix-convex regular languages
    Brzozowski, Janusz A.
    Sinnamon, Corwin
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 2 - 13
  • [38] Prefix-free regular languages and pattern matching
    Han, Yo-Sub
    Wang, Yajun
    Wood, Derick
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 307 - 317
  • [39] PREFIX-FREE LANGUAGES AS OMEGA-GENERATORS
    LITOVSKY, I
    INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 61 - 65
  • [40] Kuratowski Algebras Generated by Prefix-Free Languages
    Jirasek, Jozef, Jr.
    Sebej, Juraj
    Implementation and Application of Automata, 2016, 9705 : 150 - 162