Author of the publication

Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata.

, and . ICGI, volume 5278 of Lecture Notes in Computer Science, page 163-174. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Gavaldà, Ricard
add a person with the name Gavaldà, Ricard
 

Other publications of authors with the same name

SalaboMiner - A Biomedical Literature Mining Tool for Inferring the Genetics of Complex Diseases., , , and . BIOINFORMATICS, page 143-148. SciTePress, (2011)Kolmogorov randomness and its applications to structural complexity theory.. University Barcelona, (1992)Learning probabilistic automata: A study in state distinguishability., , and . Theor. Comput. Sci., (2013)The Query Complexity of Learning DFA., , , and . New Generation Comput., 12 (4): 337-358 (1994)Non-Automatizability of Bounded-Depth Frege Proofs., , , , and . Computational Complexity, 13 (1-2): 47-68 (2004)Learning Expressions over Monoids., and . STACS, volume 2010 of Lecture Notes in Computer Science, page 283-293. Springer, (2001)Adaptive Learning from Evolving Data Streams., and . IDA, volume 5772 of Lecture Notes in Computer Science, page 249-260. Springer, (2009)Sequential Sampling Algorithms: Unified Analysis and Lower Bounds., and . SAGA, volume 2264 of Lecture Notes in Computer Science, page 173-188. Springer, (2001)Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata., and . ICGI, volume 5278 of Lecture Notes in Computer Science, page 163-174. Springer, (2008)Learning Ordered Binary Decision Diagrams., and . ALT, volume 997 of Lecture Notes in Computer Science, page 228-238. Springer, (1995)