MSO-definable Properties of Muller Context-Free Languages Are Decidable [chapter]

Zoltán Ésik, Szabolcs Iván
2016 Lecture Notes in Computer Science  
We show that it is decidable given an MSO-definable property P of countable words and a Muller context-free grammar G, whether every word in the language generated by G satisfies P .
doi:10.1007/978-3-319-41114-9_7 fatcat:4dumxlmqing7zhdfn62rwzd52e