Regular Expressions for Muller Context-Free Languages

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Acta cybernetica (Szeged) 2017, Vol.23 (1), p.349-369
Hauptverfasser: Gelle, Kitti, Iván, Szabolcs
Format: Artikel
Sprache:eng
Schlagworte:
Context free languages
Grammars
Languages
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0324-721X
DOI:10.14232/actacyb.23.1.2017.19