Login / Signup

The complexity of intersecting finite automata having few final states.

Michael BlondinAndreas KrebsPierre McKenzie
Published in: Comput. Complex. (2016)
Keyphrases
  • finite automata
  • finite automaton
  • regular expressions
  • probabilistic automata
  • deterministic automata
  • grammatical inference
  • tree automata
  • hidden markov models
  • regular languages
  • knowledge base