• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Context-free languages can be accepted with absolutely no space overhead.

Lane A. HemaspaandraProshanto MukherjiTill Tantau
Published in: Inf. Comput. (2005)
Keyphrases
  • context free languages
  • context free
  • information retrieval
  • relational databases
  • context free grammars
  • database
  • optimal solution
  • computational complexity
  • np hard
  • regular languages