On nilpotent languages and their characterization by regular expressions

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.)...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Gyurica György
Dokumentumtípus: Cikk
Megjelent: 2009
Sorozat:Acta cybernetica 19 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
doi:10.14232/actacyb.19.1.2009.15

Online Access:http://acta.bibl.u-szeged.hu/12863
LEADER 01439nab a2200229 i 4500
001 acta12863
005 20220617090025.0
008 161015s2009 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.19.1.2009.15  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Gyurica György 
245 1 3 |a On nilpotent languages and their characterization by regular expressions  |h [elektronikus dokumentum] /  |c  Gyurica György 
260 |c 2009 
300 |a 231-244 
490 0 |a Acta cybernetica  |v 19 No. 1 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
856 4 0 |u http://acta.bibl.u-szeged.hu/12863/1/actacyb_19_1_2009_15.pdf  |z Dokumentum-elérés