Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard.
Christophe Costa FlorêncioPublished in: ICGI (2002)
Keyphrases
- np hard
- context free languages
- shortest common supersequence
- optimal solution
- finite state automata
- scheduling problem
- np complete
- lower bound
- worst case
- linear programming
- approximation algorithms
- special case
- three dimensional
- closely related
- constraint satisfaction problems
- context free grammars
- np hardness
- natural language
- computational complexity
- knapsack problem
- integer programming
- edit distance
- greedy heuristic
- computationally tractable
- dynamic programming
- syntactic pattern recognition
- visual languages
- stochastic grammar