Characterizing Regular Languages with Polynomial Densities.
Andrew SzilardSheng YuKaizhong ZhangJeffrey O. ShallitPublished in: MFCS (1992)
Keyphrases
- regular languages
- equivalence queries
- context free languages
- grammatical inference
- regular expressions
- finite automata
- statistical queries
- context free grammars
- decision problems
- membership queries
- efficient learning
- positive data
- pac learning
- context free
- finite state machines
- xml schema
- decision trees
- pac learnable
- uniform distribution
- knowledge base
- databases