On Müller context-free grammars

DOI10.1016/j.tcs.2011.10.012zbMath1232.68079OpenAlexW2009612781MaRDI QIDQ764314

Zoltán Ésik, Szabolcs Iván

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.012

zbMATH Keywords

scatteredcountable wordsMüller acceptance conditioncontext-free languages of countable wordsdense wordsquasi-dense wordswell-ordered

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

MSO-definable Properties of Muller Context-Free Languages Are Decidable ⋮ ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS ⋮ OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs

Cites Work

• Automata on linear orderings
• The monadic second order theory of all countable ordinals
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• Context-Free Languages of Countable Words
• On the Equimorphism Types of Linear Orderings
• Developments in Language Theory
• Mathematical Foundations of Computer Science 2005
• $ℵ_0$-categoricity of linear orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Müller context-free grammars