We study the differences between finite identifiability of recursive languages with positive and with complete data. In finite families the difference lies exactly in the fact that for positive identification the families need to be anti-chains, while in the infinite case it is less simple, being an anti-chain is no longer a sufficient condition. We also study maximal learnable families, identifiable families with no proper extension which can be identified. We show that these often though not always exist with positive identification, but that with complete data there are no maximal learnable families at all. We also investigate a conjecture of ours, namely that each positively identifiable family has either finitely many or uncountably many maximal noneffectively positively identifiable extensions. We verify this conjecture for the restricted case of families of equinumerous finite languages.
CITATION STYLE
de Jongh, D., & Vargas-Sandoval, A. L. (2019). Finite Identification with Positive and with Complete Data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11456 LNCS, pp. 42–63). Springer Verlag. https://doi.org/10.1007/978-3-662-59565-7_3
Mendeley helps you to discover research relevant for your work.