Minimising Deterministic Büchi Automata Precisely Using SAT Solving

DOI10.1007/978-3-642-14186-7_28zbMath1306.68094OpenAlexW2130429059MaRDI QIDQ4930600

Rüdiger Ehlers

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata

Uses Software

• PicoSAT

This page was built for publication: Minimising Deterministic Büchi Automata Precisely Using SAT Solving