On Approximating Non-regular Languages by Regular Languages.
Gerry EismanBala RavikumarPublished in: Fundam. Informaticae (2011)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- context free grammars
- pac learning
- finite state machines
- positive data
- pattern matching
- inductive inference
- context free
- query language
- equivalence queries
- reinforcement learning
- relational databases
- statistical queries
- learning problems
- databases
- optimal policy
- membership queries
- np hard
- optimal solution
- machine learning