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 条
  • [1] Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
    Brzozowski, Janusz
    Li, Baiyu
    Ye, Yuli
    THEORETICAL COMPUTER SCIENCE, 2012, 449 : 37 - 53
  • [2] Complexity of bifix-free regular languages
    Ferens, Robert
    Szykula, Marek
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 14 - 27
  • [3] Nondeterministic State Complexity for Suffix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 189 - 196
  • [4] Syntactic complexity of bifix-free regular languages
    Szykula, Marek
    Wittnebel, John
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 45 - 76
  • [5] State complexity of combined operations for suffix-free regular languages
    Eom, Hae-Sung
    Han, Yo-Sub
    THEORETICAL COMPUTER SCIENCE, 2013, 510 : 87 - 93
  • [6] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 501 - +
  • [7] State complexity of basic operations on suffix-free regular languages
    Han, Yo-Sub
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2537 - 2548
  • [8] State Complexity of Combined Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Yu, Sheng
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 398 - +
  • [9] Complexity of suffix-free regular languages
    Brzozowski, Janusz A.
    Szykula, Marek
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 270 - 287
  • [10] Complexity in Prefix-Free Regular Languages
    Jiraskova, Galina
    Krausova, Monika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 197 - 204
12345