Some Bounds on Quasi-Initialised Finite Automata.
Paulo A. S. VelosoPublished in: International Computing Symposium (1977)
Keyphrases
- finite automata
- deterministic automata
- regular expressions
- probabilistic automata
- grammatical inference
- tree automata
- upper bound
- lower bound
- finite automaton
- vc dimension
- hidden markov models
- regular languages
- gene expression
- integrity constraints
- pattern matching
- domain specific
- object oriented
- query language
- machine learning