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 条
  • [31] State Complexity of Regular Tree Languages for Tree Matching
    Ko, Sang-Ki
    Lee, Ha-Rim
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (08) : 965 - 979
  • [32] State complexity of some operations on binary regular languages
    Jirásková, G
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 287 - 298
  • [33] On a structural property in the state complexity of projected regular languages
    Jiraskova, Galina
    Masopust, Tomas
    THEORETICAL COMPUTER SCIENCE, 2012, 449 : 93 - 105
  • [34] On the State Complexity of Closures and Interiors of Regular Languages with Subwords
    Karandikar, Prateek
    Schnoebelen, Philippe
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 234 - 245
  • [35] Finite Transducers and Nondeterministic State Complexity of Regular Languages
    Povarov, G. A.
    RUSSIAN MATHEMATICS, 2010, 54 (06) : 19 - 25
  • [36] On the State Complexity of Complements, Stars, and Reversals of Regular Languages
    Jiraskova, Galina
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 431 - 442
  • [37] Parameterized Prefix Distance between Regular Languages
    Kutrib, Martin
    Meckel, Katja
    Wendlandt, Matthias
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 419 - 430
  • [38] PREFIX GRAMMARS - AN ALTERNATIVE CHARACTERIZATION OF THE REGULAR LANGUAGES
    FRAZIER, M
    PAGE, CD
    INFORMATION PROCESSING LETTERS, 1994, 51 (02) : 67 - 71
  • [39] Syntactic complexity of suffix-free languages
    Brzozowski, Janusz A.
    Szykula, Marek
    INFORMATION AND COMPUTATION, 2018, 259 : 174 - 190
  • [40] A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions
    Yamamoto, Hiroaki
    Fujiwara, Hiroshi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (03): : 381 - 388
12345