Jose Oncina

Available identifiers

Publication	Date of Publication	Type
Computing the expected edit distance from a string to a probabilistic finite-state automaton	2018-02-22	Paper
Computing the expected edit distance from a string to a PFA	2016-11-09	Paper
The most probable string: an algorithmic study	2014-05-12	Paper
Identification with probability one of stochastic deterministic linear languages	2010-02-23	Paper
Learning Multiplicity Tree Automata	2008-11-27	Paper
Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries	2008-10-16	Paper
Grammatical Inference: Algorithms and Applications	2006-10-20	Paper
Grammatical Inference: Algorithms and Applications	2006-10-20	Paper
Learning stochastic edit distance: application in handwritten character recognition	2006-08-16	Paper
Some approaches to improve tree-based nearest neighbour search algorithms	2005-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q3046706	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4809020	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4809019	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4440392	2003-12-17	Paper
A modification of the LAESA algorithm for approximated k-NN classification	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4536573	2002-06-25	Paper
An approximate median search algorithm in non-metric spaces	2002-04-09	Paper
Stochastic inference of regular tree languages	2001-10-14	Paper
Learning deterministic regular grammars from stochastic samples in polynomial time	2000-07-19	Paper

This page was built for person: Jose Oncina