Login / Signup

On a structural property in the state complexity of projected regular languages.

Galina JiráskováTomás Masopust
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • regular languages
  • decision problems
  • context free languages
  • regular expressions
  • finite automata
  • databases
  • computational complexity
  • state space
  • model selection
  • finite state machines
  • grammatical inference