Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.
Christophe Costa FlorêncioJonny DaenenJan RamonJan Van den BusscheDries Van DyckPublished in: J. Univers. Comput. Sci. (2015)
Keyphrases
- context free languages
- regular languages
- finite automata
- positive data
- grammatical inference
- equivalence queries
- regular expressions
- statistical queries
- context free grammars
- context free
- decision problems
- pac learning
- membership queries
- special case
- efficient learning
- computational complexity
- lower bound
- uniform distribution
- positive and negative
- pattern matching
- dynamic programming
- hidden markov models
- machine learning
- positive examples
- sample complexity
- context dependent
- learning theory
- data exchange
- worst case
- object oriented