Login / Signup

The Complexity of Compressed Membership Problems for Finite Automata.

Artur Jez
Published in: Theory Comput. Syst. (2014)
Keyphrases
  • finite automata
  • decision problems
  • regular expressions
  • probabilistic automata
  • np complete
  • data analysis
  • natural language processing