Minimising Deterministic Büchi Automata Precisely Using SAT Solving.

Rüdiger Ehlers

Published in: SAT (2010)

Keyphrases

sat solving
finite state automaton
sat solvers
boolean optimization
max sat
sat problem
boolean satisfiability
cellular automata
sat encodings
search space
optimal solution
branch and bound
regular expressions
finite state