Regular expressions for muller context-free languages
AbstractMuller 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.
How to Cite
Gelle, K., & Iván, S. (2017). Regular expressions for muller context-free languages. Acta Cybernetica, 23(1), 349-369. https://doi.org/10.14232/actacyb.23.1.2017.19