Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata.
Uraz Cengiz TürkerPublished in: Turkish J. Electr. Eng. Comput. Sci. (2019)
Keyphrases
- brute force
- finite automata
- exhaustive search
- cost function
- learning algorithm
- computational complexity
- hidden markov models
- np hard
- dynamic programming
- computationally expensive
- particle swarm optimization
- optimal solution
- matching algorithm
- objective function
- database
- relative entropy
- finite automaton
- computational biology
- mathematical model
- simulated annealing
- search algorithm