An algorithm to verify local threshold testability of deterministic finite automata.
A. N. TrahtmanPublished in: CoRR (2021)
Keyphrases
- deterministic finite automata
- k means
- np hard
- times faster
- optimization algorithm
- learning algorithm
- experimental evaluation
- objective function
- thresholding algorithm
- computational complexity
- simulated annealing
- worst case
- computational cost
- cost function
- preprocessing
- segmentation algorithm
- detection algorithm
- dynamic programming
- high accuracy
- linear programming
- clustering method
- matching algorithm
- data analysis
- convergence rate
- threshold selection
- optimal solution
- similarity measure