Login / Signup

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata.

Hing Leung
Published in: SIAM J. Comput. (1998)
Keyphrases
  • finite automata
  • deterministic automata
  • regular expressions
  • probabilistic automata
  • grammatical inference
  • hidden markov models
  • tree automata
  • finite automaton
  • regular languages
  • artificial intelligence