Efficient algorithms for membership in boolean hierarchies of regular languages.
Christian GlaßerHeinz SchmitzVictor L. SelivanovPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- finite automata
- decision problems
- context free grammars
- pac learning
- positive data
- boolean functions
- statistical queries
- context free
- finite state machines
- positive and negative
- pattern matching
- reinforcement learning
- equivalence queries
- theoretical analysis