Repetition-Free Derivability from a Regular Grammar is NP-Hard.
Jochen BurghardtPublished in: CoRR (2016)
Keyphrases
- np hard
- context free
- optimal solution
- special case
- scheduling problem
- closely related
- branch and bound algorithm
- lower bound
- approximation algorithms
- knapsack problem
- remains np hard
- context free grammars
- context dependent
- np complete
- linear programming
- integer programming
- minimum cost
- natural language
- computationally hard
- grammar rules
- computational complexity
- grammatical inference
- case study
- np hardness
- graph grammars
- boolean variables
- machine learning