Morphisms on infinite alphabets, countable states automata and regular sequences.
Jie-Meng ZhangJin ChenYingjun GuoZhi-Xiong WenPublished in: CoRR (2016)
Keyphrases
- regular languages
- sequence alignment
- regular expressions
- finite state machines
- finite automata
- hidden markov models
- finite automaton
- grammatical inference
- deterministic finite automata
- markov chain
- action sequences
- finite state automata
- context free
- finite state
- decision problems
- cellular automata
- machine learning
- finite state automaton
- multiple sequence alignment
- state variables
- data sets
- biological sequences
- context free grammars
- variable length
- protein sequences
- sequential patterns