3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.
Henry N. AdornaPublished in: J. Autom. Lang. Comb. (2002)
Keyphrases
- finite automata
- lower bound
- deterministic automata
- grammatical inference
- probabilistic automata
- worst case
- computational complexity
- upper bound
- finite automaton
- space complexity
- multi party
- regular expressions
- tree automata
- average case complexity
- memory requirements
- hidden markov models
- inductive inference
- matching algorithm
- finite state automata
- np hard
- objective function
- machine learning