Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples

From Tetherless World Wiki

Jump to: navigation, search
 Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
Has publishing details  pp. 298-306, 1999
Has title  Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
Has where published  ICML
Has year  1999
Has author  Rajesh Parekh +, Vasant Honavar +
Has identifier  DBLP:conf/icml/ParekhH99 +
Categories  Proceeding Paper +

 

Enter the name of the page to start browsing from.
Retrieved from "http://tw.rpi.edu/wiki/Special:Browse"
Views
Personal tools