On nilpotent languages and their characterization by regular expressions

Gyurica, György: On nilpotent languages and their characterization by regular expressions. In: Acta cybernetica, (19) 1. pp. 231-244. (2009)

[img]
Preview
Cikk, tanulmány, mű
actacyb_19_1_2009_15.pdf

Download (189kB) | Preview

Abstract

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), 117-134.) 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.

Item Type: Article
Heading title: Regular papers
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 1
ISSN: 0324-721X
Page Range: pp. 231-244
Language: angol
DOI: https://doi.org/10.14232/actacyb.19.1.2009.15
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 244. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 06. 10:10
URI: http://acta.bibl.u-szeged.hu/id/eprint/12863

Actions (login required)

View Item View Item