State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages

被引：0
|
作者：
Pribavkina, Elena V. [1 ]
Rodaro, Emanuele [2 ]
机构：
[1] Ural State Univ, Ekaterinburg 620083, Russia
[2] Univ Porto, Fac Ciencias, Dept Matemat, P-4169007 Oporto, Portugal
来源：
DEVELOPMENTS IN LANGUAGE THEORY | 2010年 / 6224卷
基金：
俄罗斯基础研究基金会;
关键词：
SYNCHRONIZING AUTOMATA; BASIC OPERATIONS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider four operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix and infix) out of a given regular language. We give the precise values of the (deterministic) state complexity of each of these operators.
引用
收藏
页码：376 / +
页数：3
相关论文
共 50 条
  • [41] On the state complexity of closures and interiors of regular languages with subwords and superwords
    Karandikar, P.
    Niewerth, M.
    Schnoebelen, Ph.
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 91 - 107
  • [42] State Complexity of Suffix Distance
    Ng, Timothy
    Rappaport, David
    Salomaa, Kai
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 287 - 298
  • [43] State Complexity of Star and Square of Union of k Regular Languages
    Gao, Yuan
    Kari, Lila
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 155 - 168
  • [44] State Complexity of Regular Tree Languages for Tree Pattern Matching
    Ko, Sang-Ki
    Lee, Ha-Rim
    Han, Yo-Sub
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 246 - 257
  • [45] State complexity of union and intersection of star on k regular languages
    Gao, Yuan
    Kari, Lila
    Yu, Sheng
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 98 - 107
  • [46] State Complexity of Suffix Distance
    Ng, Timothy
    Rappaport, David
    Salomaa, Kai
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2019, 30 (6-7) : 1197 - 1216
  • [47] Circuit complexity of regular languages
    Koucky, Michal
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 426 - 435
  • [48] Circuit Complexity of Regular Languages
    Koucky, Michal
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 865 - 879
  • [49] Combinatorial complexity of regular languages
    Shur, Arseny M.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 289 - 301
  • [50] Circuit Complexity of Regular Languages
    Michal Koucký
    Theory of Computing Systems, 2009, 45 : 865 - 879
12345