Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems.
A. O. SlisenkoPublished in: Inf. Process. Lett. (1982)
Keyphrases
- hard problems
- context free grammars
- grammatical inference
- special case
- context free languages
- phase transition
- equivalence queries
- covering arrays
- hyper heuristics
- computational complexity
- context free
- natural language
- attribute grammars
- constraint satisfaction
- genetic programming
- knowledge base
- databases
- predicate invention
- database