Finite automata for testing composition-based reconstructibility of sequences.
Qiang LiHuimin XiePublished in: J. Comput. Syst. Sci. (2008)
Keyphrases
- finite automata
- hidden markov models
- regular expressions
- test sequences
- grammatical inference
- deterministic automata
- probabilistic automata
- longest common subsequence
- finite automaton
- tree automata
- regular languages
- sequential patterns
- test cases
- database
- biological sequences
- sequence alignment
- expert systems
- artificial intelligence
- data mining