Characterizations of regular languages in low level complexity classes.
Kevin J. ComptonHoward StraubingPublished in: Bull. EATCS (1992)
Keyphrases
- regular languages
- decision problems
- low level
- context free languages
- grammatical inference
- regular expressions
- finite automata
- positive data
- high level
- context free grammars
- context free
- optimal policy
- pac learning
- finite state machines
- np hard
- positive and negative
- computational complexity
- database systems
- semantic information
- training data
- context dependent
- pattern matching
- theoretical analysis
- semi supervised learning
- supervised learning
- equivalence queries
- machine learning