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 条
  • [21] Characterization of Fuzzy Regular Languages
    Ramaswamy, V.
    Girijamma, H. A.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (12): : 306 - 308
  • [22] A HOMOMORPHIC CHARACTERIZATION OF REGULAR LANGUAGES
    CULIK, K
    FICH, FE
    SALOMAA, A
    DISCRETE APPLIED MATHEMATICS, 1982, 4 (02) : 149 - 152
  • [23] Characterization of local regular languages
    Discrete Math, 1-3 (195-203):
  • [24] Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts
    Barozzini, David
    de Frutos-Escrig, David
    Della Monica, Dario
    Montanari, Angelo
    Sala, Pietro
    THEORETICAL COMPUTER SCIENCE, 2020, 813 : 270 - 304
  • [25] Regular expressions and context-free grammars for picture languages
    Matz, O
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 283 - 294
  • [26] Regular expressions with truth values in lattice-monoid and their languages
    Li, YM
    Pedrycz, W
    NAFIPS 2004: ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1AND 2: FUZZY SETS IN THE HEART OF THE CANADIAN ROCKIES, 2004, : 572 - 577
  • [27] A characterization of regular expressions under bisimulation
    Baeten, J. C. M.
    Corradini, F.
    Grabmayer, C. A.
    JOURNAL OF THE ACM, 2007, 54 (02)
  • [28] TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
    Wang, Y. B.
    Li, Y. M.
    IRANIAN JOURNAL OF FUZZY SYSTEMS, 2018, 15 (04): : 43 - 56
  • [29] A logical characterization of timed regular languages
    Bersani, Marcello M.
    Rossi, Matteo
    San Pietro, Pierluigi
    THEORETICAL COMPUTER SCIENCE, 2017, 658 : 46 - 59
  • [30] PREFIX GRAMMARS - AN ALTERNATIVE CHARACTERIZATION OF THE REGULAR LANGUAGES
    FRAZIER, M
    PAGE, CD
    INFORMATION PROCESSING LETTERS, 1994, 51 (02) : 67 - 71
12345