Lower Bounds for the Space Complexity of Context-Free Recognition.
Helmut AltKurt MehlhornPublished in: ICALP (1976)
Keyphrases
- space complexity
- context free
- lower bound
- worst case
- upper bound
- context sensitive
- context dependent
- grammatical inference
- context free grammars
- arc consistency
- finite state
- graph grammars
- objective function
- parse tree
- inductive inference
- np hard
- pattern matching
- co occurrence
- search algorithm
- data structure
- optimal solution
- information retrieval
- worst case time complexity