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.)...
Elmentve itt :
| Szerző: | |
|---|---|
| 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 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 231-244 |
| ISSN: | 0324-721X |