Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata

DOI10.1007/978-3-319-33693-0_16zbMath1354.03050OpenAlexW2479040464MaRDI QIDQ2814129

Stephan Barth

Publication date: 17 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33693-0_16

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Uses Software

• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of ultimately periodic languages and automata with an application to time granularity
• MONA IMPLEMENTATION SECRETS
• State of Büchi Complementation
• Minimising Deterministic Büchi Automata Precisely Using SAT Solving
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages

This page was built for publication: Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata