MSO-definable Properties of Muller Context-Free Languages Are Decidable

DOI10.1007/978-3-319-41114-9_7zbMath1476.03050OpenAlexW2475544006MaRDI QIDQ2829973

Szabolcs Iván, Zoltán Ésik

Publication date: 9 November 2016

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01633953/file/416473_1_En_7_Chapter.pdf

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Büchi context-free languages
• On Müller context-free grammars
• Automata on linear orderings
• 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
• Logic and Rational Languages of Words Indexed by Linear Orderings
• Developments in Language Theory
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: MSO-definable Properties of Muller Context-Free Languages Are Decidable