A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Helmut AltViliam GeffertKurt MehlhornPublished in: Inf. Process. Lett. (1992)
Keyphrases
- space complexity
- context free
- lower bound
- finite state
- worst case
- upper bound
- context dependent
- context sensitive
- grammatical inference
- context free grammars
- arc consistency
- objective function
- markov decision processes
- inductive inference
- markov chain
- graph grammars
- finite automata
- text classification
- state space
- np hard
- optimal solution
- grammar rules
- machine learning
- xml documents
- search space
- computational complexity