MSO-definable properties of Muller context-free languages are decidable
From MaRDI portal
Publication:2829973
DOI10.1007/978-3-319-41114-9_7zbMATH Open1476.03050OpenAlexW2475544006MaRDI QIDQ2829973FDOQ2829973
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
Recommendations
Cites Work
- Finite automata and ordinals
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Title not available (Why is that?)
- Logic and Rational Languages of Words Indexed by Linear Orderings
- Title not available (Why is that?)
- Automata on linear orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developments in Language Theory
- Büchi context-free languages
- On Müller context-free grammars
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)
