N-PREFIX SUFFIX LANGUAGES

被引：16
|
作者：
ITO, M
JURGENSEN, H
SHYR, HJ
THIERRIN, G
机构：
[1] UNIV WESTERN ONTARIO,DEPT COMP SCI,LONDON N6A 5B7,ONTARIO,CANADA
[2] KYOTO SANGYO UNIV,FAC SCI,KYOTO 603,JAPAN
[3] NATL CHUNG HSING UNIV,DEPT APPL MATH,TAICHUNG,TAIWAN
[4] UNIV WESTERN ONTARIO,DEPT MATH,LONDON N6A 5B7,ONTARIO,CANADA
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1989年 / 30卷 / 1-2期
关键词：
D O I：
10.1080/00207168908803768
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：37 / 56
页数：20
相关论文
共 50 条
  • [41] Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
    Jirasek, Jozef, Jr.
    Palmovsky, Matus
    Sebej, Juraj
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2019, 30 (6-7) : 1091 - 1115
  • [42] On generation of permutations through suffix/prefix reversing in a cellular network
    Kokosinski, Z
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 249 - 254
  • [43] OPTIMAL PARALLEL SUFFIX-PREFIX MATCHING ALGORITHM AND APPLICATIONS
    KEDEM, ZM
    LANDAU, GM
    PALEM, KV
    SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 388 - 398
  • [44] Aspectual pairs: Prefix vs. suffix way of formation
    Solovyev, Valery
    Bochkarev, Vladimir
    Bayrasheva, Venera
    RUSSIAN JOURNAL OF LINGUISTICS, 2022, 26 (04): : 1114 - 1135
  • [45] Improved Filters for the Approximate Suffix-Prefix Overlap Problem
    Kucherov, Gregory
    Tsur, Dekel
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 139 - 148
  • [46] Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions
    Gabrys, Ryan
    Pattabiraman, Srilakshmi
    Milenkovic, Olgica
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [47] Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
    Rachid, Maan Haj
    Malluhi, Qutaibah
    Abouelhoda, Andmohamed
    BIOMED RESEARCH INTERNATIONAL, 2014, 2014
  • [48] Regular Languages meet Prefix Sorting
    Alanko, Jarno
    D'Agostino, Giovanna
    Policriti, Alberto
    Prezza, Nicola
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 911 - 930
  • [49] Prefix Distance Between Regular Languages
    Ng, Timothy
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 224 - 235
  • [50] Regular Languages meet Prefix Sorting
    Alanko, Jarno
    D'Agostino, Giovanna
    Policriti, Alberto
    Prezza, Nicola
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 911 - 930
12345