Login / Signup

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages.

Narad RampersadJeffrey O. ShallitZhi Xu
Published in: Fundam. Informaticae (2012)
Keyphrases
  • computational complexity
  • decision problems
  • regular languages
  • database systems
  • machine learning
  • training data
  • text classification
  • regular expressions
  • context free languages