MSO-definable Properties of Muller Context-Free Languages Are Decidable
Résumé
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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...