Login / Signup

Improved descriptional complexity results on generalized forbidding grammars.

Henning FernauLakshmanan KuppusamyRufus O. OladeleIndhumathi Raman
Published in: Discret. Appl. Math. (2022)
Keyphrases
  • worst case
  • natural language
  • computational complexity
  • upper bound
  • decision problems
  • website
  • improved algorithm
  • context free grammars
  • finite state automata
  • visual languages