Regular Expressions for Muller Context-Free Languages | Zendy

Kitti Gelle | Zendy; Szabolcs Iván | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Regular Expressions for Muller Context-Free Languages

Author(s) -

Kitti Gelle,

Szabolcs Iván

Publication year - 2017

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.23.1.2017.19

Subject(s) - countable set , abstract family of languages , context free language , computer science , pumping lemma for regular languages , context (archaeology) , nondeterministic algorithm , mathematics , discrete mathematics , regular language , language family , rule based machine translation , programming language , combinatorics , linguistics , theoretical computer science , artificial intelligence , second generation programming language , automaton , fifth generation programming language , paleontology , philosophy , programming paradigm , biology

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 mu eta-regular expression.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research