Login / Signup

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.

Yo-Sub HanKai SalomaaDerick Wood
Published in: Fundam. Informaticae (2009)
Keyphrases
  • regular languages
  • finite automata
  • decision problems
  • regular expressions
  • grammatical inference
  • context free languages
  • database
  • worst case
  • finite state
  • machine learning
  • query processing
  • data model