Boundedness in languages of infinite words

DOI10.23638/LMCS-13(4:3)2017zbMATH Open1459.68095arXiv1708.09765MaRDI QIDQ4596779FDOQ4596779

Authors: Mikołaj Bojańczyk, Thomas Colcombet 

Publication date: 11 December 2017

Full work available at URL: https://arxiv.org/abs/1708.09765

Recommendations

• Weak MSO with the unbounding quantifier
• Weak MSO with the unbounding quantifier
• Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
• On expressive power of regular expressions over infinite orders
• Quantifier alternation for infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
• Points d'orbite dense de certains langages de mots infinis
• Title not available (Why is that?)
• An interval temporal logic characterization of extended \(\omega\)-regular languages
• Strategical languages of infinite words
• Weak MSO with the unbounding quantifier
• Universality of R-automata with Value Copying
• Completeness results for omega-regular algebras
• Languages obtained from infinite words

This page was built for publication: Boundedness in languages of infinite words

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