{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:37Z","timestamp":1725550537398},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292425"},{"type":"electronic","value":"9783540316961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564089_14","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T13:51:09Z","timestamp":1128952269000},"page":"157-170","source":"Crossref","is-referenced-by-count":2,"title":["PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance"],"prefix":"10.1007","author":[{"given":"Nick","family":"Palmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Abe, N., Takeuchi, J., Warmuth, M.: Polynomial Learnability of Stochastic Rules with respect to the KL-divergence and Quadratic Distance. IEICE Trans. Inf. and Syst.\u00a0E84-D(3), 299\u2013315 (2001)"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural Network Learning: Theoretical Foundations","author":"M. Anthony","year":"1999","unstructured":"Anthony, M., Bartlett, P.L.: Neural Network Learning: Theoretical Foundations. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR3","first-page":"473","volume":"5","author":"A. Clark","year":"2004","unstructured":"Clark, A., Thollard, F.: PAC-learnability of Probabilistic Deterministic Finite State Automata. Journal of Machine Learning Research\u00a05, 473\u2013497 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"14_CR4","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, Chichester (1991)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/S0097539798342496","volume":"31","author":"M. Cryan","year":"2001","unstructured":"Cryan, M., Goldberg, L.A., Goldberg, P.W.: Evolutionary Trees can be Learnt in Polynomial Time in the Two-State General Markov Model. SIAM Journal on Computing\u00a031(2), 375\u2013397 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44581-1_20","volume-title":"Computational Learning Theory","author":"P.W. Goldberg","year":"2001","unstructured":"Goldberg, P.W.: When can two unsupervised learners achieve PAC separation? In: Helmbold, D.P., Williamson, B. (eds.) COLT 2001 and EuroCOLT 2001. LNCS (LNAI), vol.\u00a02111, pp. 303\u2013319. Springer, Heidelberg (2001)"},{"key":"14_CR7","unstructured":"de la Higuera, C., Oncina, J.: Learning Probabilistic Finite Automata. tech. rept. EURISE, Universit\u00e9 de Saint-Etienne and Departamento de Lenguajes y Sistemas Informaticos (2002)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R.E., Sellie, L.: On the Learnability of Discrete Distributions. In: Procs. of STOC, pp. 273\u2013282 (1994)","DOI":"10.1145\/195058.195155"},{"key":"14_CR9","unstructured":"Palmer, N., Goldberg, P.W.: PAC Classification via PAC Estimates of Label Class Distributions. Tech rept.\u00a0411, Dept.\u00a0of Computer Science, University of Warwick (2004)"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jcss.1997.1555","volume":"56","author":"D. Ron","year":"1998","unstructured":"Ron, D., Singer, Y., Tishby, N.: On the Learnability and Usage of Acyclic Probabilistic Finite Automata. Journal of Computer and System Sciences\u00a056(2), 133\u2013152 (1998)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564089_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:16Z","timestamp":1619507716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564089_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292425","9783540316961"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11564089_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}