Login / Signup

Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.

Kai SalomaaXiuming WuSheng Yu
Published in: Theor. Comput. Sci. (2000)
Keyphrases
  • efficient implementation
  • finite automata
  • regular languages
  • regular expressions
  • grammatical inference
  • finite state automata
  • hidden markov models
  • pattern matching
  • databases
  • learning theory