%0 Conference Proceedings
%T MSO-definable Properties of Muller Context-Free Languages Are Decidable
%+ University of Szeged [Szeged]
%A Ésik, Zoltán
%A Iván, Szabolcs
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 87-97
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_7
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633953/document
%2 https://inria.hal.science/hal-01633953/file/416473_1_En_7_Chapter.pdf
%L hal-01633953
%U https://inria.hal.science/hal-01633953
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2