Login / Signup

Exponentially more concise quantum recognition of non-RMM regular languages.

Daowen QiuLvzhou LiPaulo MateusAmílcar Sernadas
Published in: J. Comput. Syst. Sci. (2015)
Keyphrases
  • regular languages
  • grammatical inference
  • regular expressions
  • context free languages
  • context free grammars
  • positive data
  • decision problems
  • finite automata
  • data model
  • pattern matching
  • pac learning