{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:48Z","timestamp":1725484428389},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45790-9_21","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T22:46:02Z","timestamp":1179269162000},"page":"261-268","source":"Crossref","is-referenced-by-count":9,"title":["On the Learnability of Hidden Markov Models"],"prefix":"10.1007","author":[{"given":"Sebastiaan A.","family":"Terwijn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"21_CR1","unstructured":"M. Anthony and N. Biggs, Computational learning theory: an introduction, Cambridge University Press, 1992."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1162\/neco.1994.6.2.307","volume":"6","author":"P. Baldi","year":"1994","unstructured":"P. Baldi and Y. Chauvin, Smooth on-line learning algorithms for hidden Markov models, Neural Computation 6 (1994) 307\u2013318.","journal-title":"Neural Computation"},{"key":"21_CR3","first-page":"1","volume":"3","author":"L. E. Baum","year":"1972","unstructured":"L. E. Baum, An inequality and associated maximization technique in statistical estimation for probabilistic functions of a Markov process, Inequalities 3, 1972, 1\u20138.","journal-title":"Inequalities"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. of the ACM 36(4), 929\u2013965, 1989.","journal-title":"J. of the ACM"},{"key":"21_CR5","unstructured":"E. Charniak, Statistical Language Learning, MIT Press, 1993."},{"key":"21_CR6","unstructured":"P. Clote and R. Backofen, Computational molecular biology: an introduction, Wiley, 2000."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, J. of the ACM 33(4) (1986) 792\u2013807.","journal-title":"J. of the ACM"},{"key":"21_CR8","unstructured":"M. J. Kearns, The computational complexity of machine learning, MIT Press, 1990."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. J. Kearns","year":"1994","unstructured":"M. J. Kearns and L. G. Valiant, Cryptographic limitations on learning boolean formulae and finite automata, J. of the ACM 41(1) (1994) 67\u201395.","journal-title":"J. of the ACM"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"M. J. Kearns, U. V. Vazirani, An introduction to computational learning theory, MIT Press, 1994.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"21_CR11","first-page":"372","volume-title":"Proc. 25th ACM Symp. on the Theory of Computing","author":"M. Kharitonov","year":"1993","unstructured":"M. Kharitonov, Cryptographic hardness of distribution-specific learning, Proc. 25th ACM Symp. on the Theory of Computing, 372\u2013381, ACM Press, N.Y., 1993."},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"L. Pitt and M. K. Warmuth, Prediction-preserving reducibility, J. Computer and System Sci. 41(3) (1990) 430\u2013467.","journal-title":"J. Computer and System Sci."},{"issue":"11","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant, A theory of the learnable, Communications of the ACM 27(11) (1984) 1134\u20131142.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:07:38Z","timestamp":1550322458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}