The State Minimization Problem for Nondeterministic Finite Automata: The Parallel Implementation of the Truncated Branch and Bound Method.
Boris MelnikovAndrey Vladimirovich TsyganovPublished in: PAAP (2012)
Keyphrases
- finite automata
- parallel implementation
- branch and bound method
- deterministic automata
- regular expressions
- grammatical inference
- finite automaton
- state space
- reduce the search space
- tree automata
- hidden markov models
- parallel computers
- optimal configuration
- branch and bound algorithm
- feasible solution
- parallel implementations
- np hard