Deterministic automata and extensions of weak MSO

DOI10.4230/LIPICS.FSTTCS.2009.2308MaRDI QIDQ2920114zbMATH OpenFDO

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

zbMATH Keywords

BS-automatadeterministic automatamax-automatamin-automataweak MSO

Mathematics Subject Classification ID

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

Recommendations

• Weak MSO with the unbounding quantifier
• Weak MSO with the unbounding quantifier
• Codeterministic automata on infinite words
• Alternating automata and logics over infinite words (extended abstract)
• Weighted automata and weighted logics on infinite words

Cited in

(8)

• Beyond -regular languages: T-regular expressions and their automata and logic counterparts
• Asymptotic Monadic Second-Order Logic
• Delay games with WMSO+U winning conditions
• Boundedness of conjunctive regular path queries
• Verified decision procedures for MSO on words based on derivatives of regular expressions
• Weak MSO with the unbounding quantifier
• Weak MSO with the unbounding quantifier
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021

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)