On Nilpotent Languages and Their Characterization by Regular Expressions

被引：0
|
作者：
Gyurica, Gyoergy [1 ]
机构：
[1] Univ Szeged, Dept Informat, Arpad Ter 2, H-6720 Szeged, Hungary
来源：
ACTA CYBERNETICA | 2009年 / 19卷 / 01期
关键词：
D O I：
10.14232/actacyb.19.1.2009.15
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Tree languages recognized by deterministic root-to-frontier recognizers are also called DR-languages. The concept of generalized R-chain languages was introduced by the author in his paper On monotone languages and their characterization by regular expressions (Acta Cybernetica, 18 (2007), 117134.) and it has turned out that the monotone DR-languages are exactly those languages that can be given by generalized R-chain languages. In this paper we give a similar characterization for nilpotent DR-languages by means of plain R-chain languages. Also a regular expression based characterization is given for nilpotent string languages.
引用
收藏
页码：231 / 244
页数：14
相关论文
共 50 条
  • [1] On monotone languages and their characterization by regular expressions
    Gyurica, Gyoergy
    ACTA CYBERNETICA, 2007, 18 (01): : 117 - 134
  • [2] Parameterized Regular Expressions and Their Languages
    Barcelo, Pablo
    Libkin, Leonid
    Reutter, Juan L.
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 351 - 362
  • [3] Enumerating regular expressions and their languages
    Lee, J
    Shallit, J
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 2 - 22
  • [4] Parameterized regular expressions and their languages
    Barcelo, Pablo
    Reutter, Juan
    Libkin, Leonid
    THEORETICAL COMPUTER SCIENCE, 2013, 474 : 21 - 45
  • [5] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
  • [6] Regular expressions -: Languages, algorithms, and software
    Kernighan, BW
    Pike, R
    DR DOBBS JOURNAL, 1999, 24 (04): : 19 - 22
  • [7] On the closure of pattern expressions languages under intersection with regular languages
    Cezar Câmpeanu
    Nicolae Santean
    Acta Informatica, 2009, 46 : 193 - 207
  • [8] On the closure of pattern expressions languages under intersection with regular languages
    Campeanu, Cezar
    Santean, Nicolae
    ACTA INFORMATICA, 2009, 46 (03) : 193 - 207
  • [9] More concise representation of regular languages by automata and regular expressions
    Geffert, Viliam
    Mereghetti, Carlo
    Palano, Beatrice
    INFORMATION AND COMPUTATION, 2010, 208 (04) : 385 - 394
  • [10] More Concise Representation of Regular Languages by Automata and Regular Expressions
    Geffert, Viliam
    Mereghetti, Carlo
    Palano, Beatrice
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 359 - +
12345