Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Christian GlaßerHeinz SchmitzVictor L. SelivanovPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- finite automata
- decision problems
- boolean functions
- context free grammars
- pac learning
- positive data
- context free
- finite state machines
- statistical queries
- uniform distribution
- pattern matching
- matching algorithm
- computational complexity
- metadata
- equivalence queries