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 条
  • [41] ON THE LANGUAGES RECOGNIZED BY NILPOTENT GROUPS
    PELADEAU, P
    THERIEN, D
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1988, 306 (02): : 93 - 95
  • [42] Inferring regular languages and ω-languages
    Fisman, Dana
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2018, 98 : 27 - 49
  • [43] Recognition and learning of a class of context-sensitive languages described by augmented regular expressions
    Alquezar, R
    Sanfeliu, A
    PATTERN RECOGNITION, 1997, 30 (01) : 163 - 182
  • [44] Regular expressions for two-dimensional languages over one-letter alphabet
    Anselmo, M
    Giammarresi, D
    Madonia, M
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 63 - 75
  • [45] Efficient recognition of a class of context-sensitive languages described by augmented regular expressions
    Sanfeliu, A.
    Alquezar, R.
    Lecture Notes in Computer Science, 1121
  • [46] The Nilpotent Regular Element Problem
    Ara, Pere
    O'Meara, Kevin C.
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2016, 59 (03): : 461 - 471
  • [47] Regular patterns, regular languages and context-free languages
    Jain, Sanjay
    Ong, Yuh Shin
    Stephan, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1114 - 1119
  • [48] An algebraic characterization of deterministic regular languages over infinite alphabets
    Francez, N
    Kaminski, M
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 155 - 175
  • [49] Regular Transducer Expressions for Regular Transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 315 - 324
  • [50] Regular transducer expressions for regular transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    INFORMATION AND COMPUTATION, 2022, 282
12345