Login / Signup

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

Massimiliano GoldwurmBeatrice PalanoMassimo Santini
Published in: STACS (2001)
Keyphrases
  • context free languages
  • decision problems
  • context free
  • regular languages
  • upper bound
  • worst case
  • grammatical inference