Login / Signup

How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.

François CosteJacques Nicolas
Published in: ICGI (1998)
Keyphrases
  • search tree
  • search algorithm
  • search space
  • branch and bound algorithm
  • depth first search
  • state space
  • b tree
  • sat solvers
  • root node
  • decision trees
  • upper bound
  • iterative deepening
  • binary search trees