ALL-SAT Automata composition Boolean functions Conjunctive normal forms Decision theory FSA intersection Finite state Propositional satisfiability Regular expressions Running time SAT solvers Several variables State-of-the-art performance Benchmarking Clause learning Construction approaches Finite automata Intersection grammars (FSIG) Model counting Pattern matching Regular expression compilation Abstract reachability trees Codes (symbols) Computational linguistics Dynamic memory Formal methods Memory consumption Memory manager Model checker Model checking