The Longest Common Subsequence Problem A Finite Automata Approach.
Borivoj MelicharTomás PolcarPublished in: CIAA (2003)
Keyphrases
- finite automata
- beam search
- probabilistic automata
- deterministic automata
- heuristic search
- regular expressions
- search algorithm
- branch and bound
- grammatical inference
- search methods
- hidden markov models
- tree automata
- ranking functions
- search problems
- finite automaton
- hill climbing
- combinatorial optimization
- data model