Reducing Nondeterministic Finite Automata with SAT Solvers.
Jaco GeldenhuysBrink van der MerweLynette van ZijlPublished in: FSMNLP (2009)
Keyphrases
- finite automata
- sat solvers
- orders of magnitude
- boolean satisfiability
- deterministic automata
- regular expressions
- sat problem
- grammatical inference
- propositional satisfiability
- search space
- constraint satisfaction
- max sat
- search strategies
- sat solving
- tree automata
- finite automaton
- sat instances
- clause learning
- genetic algorithm
- weighted max sat
- hidden markov models
- np complete
- constraint satisfaction problems
- data structure
- satisfiability problem
- metadata