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 条
  • [31] Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata
    Della Monica, Dario
    Montanari, Angelo
    Sala, Pietro
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (256): : 223 - 237
  • [32] GENERATION OF REGULAR EXPRESSIONS FOR AUTOMATA BY INTEGRAL OF REGULAR EXPRESSIONS
    SMITH, LW
    YAU, SS
    COMPUTER JOURNAL, 1972, 15 (03): : 222 - &
  • [33] LANGAGE: A maple package for automaton characterization of regular languages
    Caron, P
    THEORETICAL COMPUTER SCIENCE, 2000, 231 (01) : 5 - 15
  • [34] LANGAGE: A maple package for automaton characterization of regular languages
    Caron, P
    AUTOMATA IMPLEMENTATION, 1998, 1436 : 46 - 55
  • [35] A Logical Characterization of Timed (non-)Regular Languages
    Bersani, Marcello M.
    Rossi, Matteo
    Pietro, Pierluigi San
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 75 - 86
  • [36] On Approximating Non-regular Languages by Regular Languages
    Eisman, Gerry
    Ravikumar, Bala
    FUNDAMENTA INFORMATICAE, 2011, 110 (1-4) : 125 - 142
  • [37] Regular expressions
    Becker, P
    DR DOBBS JOURNAL, 2006, 31 (05): : 52 - +
  • [38] Regular expressions
    LeFebvre, William
    Performance Computing/Unix Review, 1999, 17 (11): : 49 - 51
  • [39] Regular expressions
    Scientific Computing and Instrumentation, 2000, 17 (08):
  • [40] Partial Derivatives for Context-Free Languages From μ-Regular Expressions to Pushdown Automata
    Thiemann, Peter
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2017), 2017, 10203 : 248 - 264
12345