Storage Requirements for Deterministic Polynomial Time Recognizable Languages.
Stephen A. CookRavi SethiPublished in: J. Comput. Syst. Sci. (1976)
Keyphrases
- storage requirements
- computational complexity
- finite automata
- computational cost
- high computational complexity
- deterministic domains
- expressive power
- special case
- grammatical inference
- memory requirements
- language independent
- database languages
- cross lingual
- turing machine
- significantly reduced
- picture languages
- databases
- approximation algorithms
- text summarization
- frame rate
- randomized algorithm
- multiresolution