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 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 349-369 |
| ISSN: | 0324-721X |