Regular expressions for muller context-free languages
Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the k...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Matematikai nyelvészet - számítógépes nyelvészet |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.1.2017.19 |
| Online Access: | http://acta.bibl.u-szeged.hu/50077 |
| LEADER | 01274nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta50077 | ||
| 005 | 20220620144936.0 | ||
| 008 | 180212s2017 hu o 0|| hun d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.23.1.2017.19 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a hun | ||
| 100 | 1 | |a Gelle Kitti | |
| 245 | 1 | 0 | |a Regular expressions for muller context-free languages |h [elektronikus dokumentum] / |c Gelle Kitti |
| 260 | |c 2017 | ||
| 300 | |a 349-369 | ||
| 490 | 0 | |a Acta cybernetica |v 23 No. 1 | |
| 520 | 3 | |a Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the known results regarding MCFLs, and show that a language is an MCFL if and only if it can be generated by a so-called µη-regular expression. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Matematikai nyelvészet - számítógépes nyelvészet | ||
| 700 | 0 | 1 | |a Iván Szabolcs |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/50077/1/actacyb_23_1_2017_19.pdf |z Dokumentum-elérés |