Login / Signup

On the State Complexity of Closures and Interiors of Regular Languages with Subwords.

Prateek KarandikarPhilippe Schnoebelen
Published in: DCFS (2014)
Keyphrases
  • regular languages
  • context free languages
  • computational complexity
  • decision problems
  • grammatical inference
  • regular expressions
  • context free
  • state space
  • data management
  • finite state machines