Login / Signup
The Complexity of Intersecting Finite Automata Having Few Final States.
Michael Blondin
Andreas Krebs
Pierre McKenzie
Published in:
Electron. Colloquium Comput. Complex. (2012)
Keyphrases
</>
finite automata
finite automaton
deterministic automata
regular expressions
probabilistic automata
grammatical inference
tree automata
domain knowledge
regular languages
databases
knowledge representation
markov chain
decision problems