Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Christian GlaßerHeinz SchmitzVictor L. SelivanovPublished in: STACS (2008)
Keyphrases
- regular languages
- grammatical inference
- context free languages
- regular expressions
- finite automata
- decision problems
- context free grammars
- positive data
- boolean functions
- pac learning
- finite state machines
- pattern matching
- statistical queries
- context free
- equivalence queries
- uniform distribution
- relational databases
- decision trees
- membership queries
- knowledge based systems
- dynamic programming
- computational complexity