Deterministic automata and extensions of weak MSO

DOI10.4230/LIPICS.FSTTCS.2009.2308zbMATH Open1248.68285MaRDI QIDQ2920114FDOQ2920114

Authors: Mikołaj Bojańczyk, Szymon Toruńczyk 

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_19cb.html

Recommendations

• Weak MSO with the unbounding quantifier
• Weak MSO with the unbounding quantifier
• Codeterministic automata on infinite words
• scientific article; zbMATH DE number 1759492
• Weighted automata and weighted logics on infinite words

zbMATH Keywords

deterministic automataBS-automatamax-automatamin-automataweak MSO

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cited In (8)

• Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
• Verified decision procedures for MSO on words based on derivatives of regular expressions
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
• Weak MSO with the unbounding quantifier
• Title not available (Why is that?)
• Delay games with WMSO+U winning conditions
• Weak MSO with the unbounding quantifier
• Asymptotic Monadic Second-Order Logic

This page was built for publication: Deterministic automata and extensions of weak MSO

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