On Müller context-free grammars
From MaRDI portal
Publication:764314
DOI10.1016/J.TCS.2011.10.012zbMATH Open1232.68079OpenAlexW2009612781MaRDI QIDQ764314FDOQ764314
Authors: 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
Recommendations
scatteredcountable wordscontext-free languages of countable wordsdense wordsquasi-dense wordswell-orderedMüller acceptance condition
Cites Work
- Finite automata and ordinals
- Mathematical Foundations of Computer Science 2005
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Title not available (Why is that?)
- $ℵ_0$-categoricity of linear orderings
- The monadic second order theory of all countable ordinals
- Title not available (Why is that?)
- Automata on linear orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Title not available (Why is that?)
- Context-Free Languages of Countable Words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developments in Language Theory
- On the Equimorphism Types of Linear Orderings
Cited In (8)
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
- On context-free languages of scattered words
- On context-free languages of scattered words
- Regular expressions for Muller context-free languages
- MSO-definable properties of Muller context-free languages are decidable
- On Müller context-free grammars
- Title not available (Why is that?)
- Büchi context-free languages
This page was built for publication: On Müller context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764314)
