On Müller context-free grammars
From MaRDI portal
Publication:764314
DOI10.1016/j.tcs.2011.10.012zbMath1232.68079MaRDI QIDQ764314
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
scattered; countable words; Müller acceptance condition; context-free languages of countable words; dense words; quasi-dense words; well-ordered
Related Items
OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs, ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS, MSO-definable Properties of Muller Context-Free Languages Are Decidable
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