MSO-definable properties of Muller context-free languages are decidable

DOI10.1007/978-3-319-41114-9_7zbMATHOpenAlexMaRDI QIDQ2829973FDO

Authors 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)

Recommendations

• On Müller context-free grammars
• On Müller context-free grammars
• Büchi context-free languages
• Context-Free Languages of Countable Words
• scientific article; zbMATH DE number 6606354

Cites work

• scientific article; zbMATH DE number 3881897 (Why is no real title available?)
• scientific article; zbMATH DE number 3915652 (Why is no real title available?)
• scientific article; zbMATH DE number 3602692 (Why is no real title available?)
• scientific article; zbMATH DE number 3624807 (Why is no real title available?)
• scientific article; zbMATH DE number 3639170 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Automata on linear orderings
• Büchi context-free languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Developments in Language Theory
• Finite automata and ordinals
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Logic and Rational Languages of Words Indexed by Linear Orderings
• On Müller context-free grammars
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages

This page was built for publication: MSO-definable properties of Muller context-free languages are decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829973)