Some Bounds on the Complexity of Predicate Recognition by Finite Automata.
Yuri BreitbartPublished in: J. Comput. Syst. Sci. (1976)
Keyphrases
- finite automata
- worst case
- probabilistic automata
- regular expressions
- recognition rate
- deterministic automata
- object recognition
- grammatical inference
- regular languages
- tree automata
- hidden markov models
- lower bound
- database
- databases
- domain knowledge
- upper bound
- object oriented
- expert systems
- knowledge acquisition
- structured data
- vc dimension
- artificial intelligence