A polynomial double reversal minimization algorithm for deterministic finite automata.
Manuel Vazquez de PargaPedro GarcíaDamián LópezPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- experimental evaluation
- deterministic finite automata
- cost function
- optimization algorithm
- preprocessing
- times faster
- detection algorithm
- np hard
- theoretical analysis
- computational cost
- expectation maximization
- linear programming
- convergence rate
- learning algorithm
- recognition algorithm
- error function
- particle swarm optimization
- high accuracy
- probabilistic model
- dynamic programming
- search space
- optimal solution
- objective function
- databases
- segmentation algorithm
- data model
- structured data
- search algorithm
- metadata
- randomized approximation